Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/288740 
Year of Publication: 
2020
Citation: 
[Journal:] Business & Information Systems Engineering [ISSN:] 1867-0202 [Volume:] 63 [Issue:] 2 [Publisher:] Springer Fachmedien Wiesbaden [Place:] Wiesbaden [Year:] 2020 [Pages:] 113-127
Publisher: 
Springer Fachmedien Wiesbaden, Wiesbaden
Abstract: 
Package bids, i.e., bids on sets of items, are an essential aspect of combinatorial auctions. They can allow bidders to accurately express their preferences. However, bidders on packages consisting of few items are often unable to outbid provisionally winning bids on large packages. To resolve this, both coordination as well as cooperation are needed. Coordination, since smaller bidders need to bid on packages that are disjoint; cooperation, since typically bid increases from more than one bidder are required to overcome the threshold to outbid a larger package bid. The authors design an information system that supports the implementation of an iterative combinatorial auction; this system is specifically aimed at helping bidders overcome coordination and threshold problems. They study the effect of information feedback on the behavior of bidders in different auction settings. The authors test this in an experimental setting using human bidders, varying feedback from very basic information about provisionally winning bids/prices, to providing more advanced concepts such as winning and deadness levels, and coalitional feedback. The experiment indicates that coalitional feedback has a positive impact on economic efficiency in cases where difficult threshold problems arise; however, it appears to have an adverse effect when threshold problems are easy.
Subjects: 
Auctions/bidding
Coordination and threshold problems
Bidder support
Laboratory experiment
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.