Relationship preserving auction for repeated e-procurement
Author(s) -
Jong Han Park,
Jae Kyu Lee,
Hoong Chuin Lau
Publication year - 2008
Publication title -
singapore management university institutional knowledge (ink) (singapore management university)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/1409540.1409587
Subject(s) - bidding , procurement , common value auction , reverse auction , english auction , microeconomics , auction theory , business , industrial organization , vickrey auction , eauction , computer science , generalized second price auction , proxy bid , economics , marketing
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 auctioneer's 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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom