Combinatorial Auction Design
Aleksandar Peke\v{c} () and
Michael H. Rothkopf ()
Additional contact information
Aleksandar Peke\v{c}: Decision Sciences, The Fuqua School of Business, Duke University, Durham, North Carolina 27708-0120
Michael H. Rothkopf: RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, New Jersey 08854-8003
Management Science, 2003, vol. 49, issue 11, 1485-1503
Abstract:
Combinatorial auctions have two features that greatly affect their design: computational complexity of winner determination and opportunities for cooperation among competitors. Dealing with these forces trade-offs between desirable auction properties such as allocative efficiency, revenue maximization, low transaction costs, fairness, failure freeness, and scalability. Computational complexity can be dealt with algorithmically by relegating the computational burden to bidders, by maintaining fairness in the face of computational limitations, by limiting biddable combinations, and by limiting the use of combinatorial bids. Combinatorial auction designs include single-round, first-price sealed bidding, Vickrey-Clarke-Groves (VCG) mechanisms, uniform and market-clearing price auctions, and iterative combinatorial auctions. Combinatorial auction designs must deal with exposure problems, threshold problems, ways to keep the bidding moving at a reasonable pace, avoiding and resolving ties, and controlling complexity.
Keywords: Auction Design; Combinatorial Bidding; Bidding with Synergies (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (68)
Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.49.11.1485.20585 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:49:y:2003:i:11:p:1485-1503
Access Statistics for this article
More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().