Iterative combinatorial auctions (ICAs) are IT-based economic mechanisms in which bidders submit bundle bids iteratively and the auctioneer computes allocations and ask prices in each auction round. In addition to strategic problems, the design of such auction designs exhibits hard computational problems. More recently, researchers have focused on the pricing and information feedback in ICAs. The main topic of this thesis is a comparison of the most important auction designs proposed in the literature by means of computational and laboratory experiments. Additionally, we developed a new auction design, which calculates item prices in every round. In laboratory experiments we tested the auction designs for practical applicability and robustness against diverse bidding strategies.
«
Iterative combinatorial auctions (ICAs) are IT-based economic mechanisms in which bidders submit bundle bids iteratively and the auctioneer computes allocations and ask prices in each auction round. In addition to strategic problems, the design of such auction designs exhibits hard computational problems. More recently, researchers have focused on the pricing and information feedback in ICAs. The main topic of this thesis is a comparison of the most important auction designs proposed in the lite...
»