An Experimental Comparison of Combinatorial Procurement Auctions
نویسندگان
چکیده
The need for new procurement auction mechanisms that allow for rich bid types such as bundle bids on multiple items has been raised in many situations in industrial procurement. In addition to strategic problems, the design of these combinatorial auctions exhibits hard computational problems. For example, the winner determination typically leads to NP-hard allocation problems in combinatorial auctions. Recently, researchers have focused on pricing and information feedback in iterative combinatorial auctions. Several auction designs have been proposed in the literature using different types of ask prices, such as linear (i.e. item-level) or non-linear (i.e. bundle) ask prices. Although, there have already been a number of successful applications in the field, little is known about the bidding behavior in combinatorial procurement auctions. Lab experiments are an excellent method to observe the human behavior in a controlled economic environment and they are an important complement to theoretical and computational models as well as field studies. In a set of lab experiments at the TU München in Spring 2007, we examined four different auction formats: the sealed-bid Vickrey-Clarke-Groves (VCG) auction and iterative Combinatorial Auctions (ICAs) such as iBundle, the Combinatorial Clock auction, and ALPSm. iBundle (Parkes and Ungar, 2000) uses non-anonymous and non-linear prices, calculates a provisional revenue maximizing allocation at the end of every round and increases the prices based on the bids of non-winning bidders. The Combinatorial Clock auction is based on linear and anonymous ask prices (Porter et al. 2003, Ausubel et al. 2006). In each round, the ask prices on all over demanded items were increased by a fixed minimum increment and the auction closes when no item is overdemanded. The fourth auction format was the ALPSm auction format, which also uses anonymous linear ask prices. However, instead of increasing the prices directly, the auction lets the bidders submit priced bids and calculates so called pseudo-dual ask prices (Bichler et al. 2007). The termination rule and the eligibility rules have been adapted. Experimental analysis In our experimental setting, we have used four different value models, two with three, one with six and one with nine items. Bidders were interested in up to 27 bundles depending on the number of auctioned items. We provided some level of bidder decision support. The bidders did not have to calculate their payoffs manually as the MarketDesigner platform allowed them to enter their valuations privately in the user interface and the system would calculates …
منابع مشابه
An Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions
We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...
متن کاملCombinatorial Auctions for Electronic Business
Combinatorial Auctions (CAs) have recently generated significant interest as an automated mechanism for buying and selling bundles of goods. They are proving to be extremely useful in numerous e-business applications such as e-selling, e-procurement, e-logistics, and B2B exchanges. In this article, we introduce combinatorial auctions and bring out important issues in the design of combinatorial...
متن کاملKombinatorische Auktionen in der betrieblichen BeschaffungEine Analyse grundlegender Entwurfsprobleme - An Analysis of Design Problems in Combinatorial Procurement Auctions
Combinatorial auctions are promising auction formats for industrial and public procurement. Potential advantages of using combinatorial auctions include lower overall spend, low transaction costs for multi-item negotiations, fairness and market transparency for suppliers, as well as high allocative efficiency. A number of fundamental design considerations are relevant to the application of comb...
متن کاملIndustrial Procurement Auctions
As illustrated in the previous chapters, combinatorial auctions have successfully been applied to various application domains, such as the allocation of airspace system resources (Chapter 20), truckload transportation (Chapter 21) and bus routes (Chapter 22). Industrial procurement is potentially a huge application domain for combinatorial auctions, and it has turned into a topic of interest fo...
متن کاملEvolutionary Techniques for Reverse Auctions
Winner determination is one of the main challenges in combinatorial auctions. However, not much work has been done to solve this problem in the case of reverse auctions using evolutionary techniques. This has motivated us to propose an improvement of a genetic algorithm based method, we have previously proposed, to address two important issues in the context of combinatorial reverse auctions: d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010