Abstract

Recently, interest in combinatorial auctions has extended to include trade in multiple units of heterogeneous items. Combinatorial bidding is complex and iterative auctions are used to allow bidders to sequentially express their preferences with the aid of auction market information provided in the form of price feedbacks. There are different competing designs for the provision of item price feedbacks; however, most of these have not been thoroughly studied for multiple unit combinatorial auctions. This paper focuses on addressing this gap by evaluating several feedback schemes or algorithms in the context of multiple unit auctions. We numerically evaluate these algorithms under different scenarios that vary in bidder package selection strategies and in the degree of competition. We observe that auction outcomes are best when bidders use a naïve bidding strategy and competition is strong. Performance deteriorates significantly when bidders strategically select packages to maximize their profit. Finally, the performances of some algorithms are more sensitive to strategic bidding than others.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call