Relationship preserving auction for repeated e-procurement

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 193
  • Download : 217
While e-procurement auction has helped firms to achieve lower procurement costs, auction mechanisms that prevail at present in procurement markets need to address an important issue that concerns the ability to maintain long term relationships with the partners, especially in repeated e-procurement settings. In this paper, we propose a Relationship Preserving Auction (RPA) mechanism that augments the conventional auction mechanism with a bidder relationship scoring model. Our proposed mechanism gives increased chances of winning to the bidders who have bidden at relatively competitive price but had comparatively less wins so far. Keeping these bidders in the auction over time will lead to more competitive bidding prices and eventually reduce the auctioneers total procurement cost in repeated auctions. From simulation experiments, we show how RPA works under different bidders behavior. We show that RPA is able to obtain lower procurement cost compared to conventional procurement auctions when bidders bid opportunistically and renege readily to other markets.
Publisher
ICEC
Issue Date
2008-08-19
Language
English
Citation

10th International Conference on Electronic Commerce 2008, ICEC'08

URI
http://hdl.handle.net/10203/24631
Appears in Collection
NE-Conference Papers(학술회의논문)MT-Conference Papers(학술회의논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0