Combinatorial Auctions: A Survey
Top Cited Papers
- 1 August 2003
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 15 (3) , 284-309
- https://doi.org/10.1287/ijoc.15.3.284.16077
Abstract
Many auctions involve the sale of a variety of distinct assets. Examples are airport time slots, delivery routes, network routing, and furniture. Because of complementarities or substitution effects between the different assets, bidders have preferences not just for particular items but for sets of items. For this reason, economic efficiency is enhanced if bidders are allowed to bid on bundles or combinations of different assets. This paper surveys the state of knowledge about the design of combinatorial auctions and presents some new insights. Periodic updates of portions of this survey will be posted to this journal's Online Supplements web page at http://joc.pubs.informs.org/OnlineSupplements.htmlKeywords
All Related Versions
This publication has 64 references indexed in Scilit:
- Robust combinatorial auction protocol against false-name bidsArtificial Intelligence, 2001
- Behavior in Multi-Unit Demand Auctions: Experiments with Uniform Price and Dynamic Vickrey AuctionsEconometrica, 2001
- On combinatorial auction and Lagrangean relaxation for distributed resource schedulingIIE Transactions, 1999
- Approximating maximum independent sets by excluding subgraphsBIT Numerical Mathematics, 1992
- Stability in circular arc graphsJournal of Algorithms, 1988
- Job Matching, Coalition Formation, and Gross SubstitutesEconometrica, 1982
- A Combinatorial Auction Mechanism for Airport Time Slot AllocationThe Bell Journal of Economics, 1982
- The design and analysis of heuristicsNetworks, 1981
- Incentives in TeamsEconometrica, 1973
- COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERSThe Journal of Finance, 1961