IDEAS home Printed from https://ideas.repec.org/p/nwu/cmsems/1296.html
   My bibliography  Save this paper

Combinatorial Auctions: A Survey

Author

Listed:
  • Sven de Vries
  • Rakesh Vohra

Abstract

Many auctions involve the sale of a variety of distinct assets. Examples are airport time slots, delivery routes and furniture. Because of complimentarities (or substitution effects) between the different assets, bidders have preferences not just for particular items but for sets or bundles 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. Second, it uses this subject as a vehicle to convey the aspects of integer programming that are relevant for the design of such auctions and combinatorial markets in general.

Suggested Citation

  • Sven de Vries & Rakesh Vohra, 2000. "Combinatorial Auctions: A Survey," Discussion Papers 1296, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  • Handle: RePEc:nwu:cmsems:1296
    as

    Download full text from publisher

    File URL: http://www.kellogg.northwestern.edu/research/math/papers/1296.pdf
    File Function: main text
    Download Restriction: no

    References listed on IDEAS

    as
    1. Babaioff, Moshe & Feldman, Michal & Nisan, Noam & Winter, Eyal, 2012. "Combinatorial agency," Journal of Economic Theory, Elsevier, vol. 147(3), pages 999-1034.
    2. Anthony M. Kwasnica & John O. Ledyard & Dave Porter & Christine DeMartini, 2005. "A New and Improved Design for Multiobject Iterative Auctions," Management Science, INFORMS, vol. 51(3), pages 419-434, March.
    3. R. Isaac & Duncan James, 2000. "Robustness of the Incentive Compatible Combinatorial Auction," Experimental Economics, Springer;Economic Science Association, vol. 3(1), pages 31-53, June.
    4. Johnson, Raymond B. & Oren, Shmuel S. & Svoboda, Alva J., 1997. "Equity and efficiency of unit commitment in competitive electricity markets," Utilities Policy, Elsevier, vol. 6(1), pages 9-19, March.
    5. Lawrence M. Ausubel & Peter Cramton & R. Preston McAfee & John McMillan, 1997. "Synergies in Wireless Telephony: Evidence from the Broadband PCS Auctions," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 6(3), pages 497-527, September.
    6. Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
    7. Jeffrey S. Banks & John O. Ledyard & David P. Porter, 1989. "Allocating Uncertain and Unresponsive Resources: An Experimental Approach," RAND Journal of Economics, The RAND Corporation, vol. 20(1), pages 1-25, Spring.
    8. Vijay Krishna & Motty Perry, 1997. "Efficient Mechanism Design," Game Theory and Information 9703010, EconWPA, revised 28 Apr 1998.
    9. Paul J. Brewer, 1999. "Decentralized computation procurement and computational robustness in a smart market," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 13(1), pages 41-92.
    10. Bikhchandani, Sushil & Mamer, John W., 1997. "Competitive Equilibrium in an Exchange Economy with Indivisibilities," Journal of Economic Theory, Elsevier, vol. 74(2), pages 385-413, June.
    11. Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
    12. S.J. Rassenti & V.L. Smith & R.L. Bulfin, 1982. "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell Journal of Economics, The RAND Corporation, vol. 13(2), pages 402-417, Autumn.
    13. Hobbs, Benjamin F. & Rothkopf, Michael H. & Hyde, Laurel C. & O'Neill, Richard P., 2000. "Evaluation of a Truthful Revelation Auction in the Context of Energy Markets with Nonconcave Benefits," Journal of Regulatory Economics, Springer, vol. 18(1), pages 5-32, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dimitris Bertsimas & Ramazan Demir, 2002. "An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems," Management Science, INFORMS, vol. 48(4), pages 550-565, April.
    2. Nicolas Gruyer & Nathalie Lenoir, 2003. "Auctioning airport slots (?)," Economics Working Papers 01, LEEA (air transport economics laboratory), ENAC (french national civil aviation school).
    3. Daniel, Joseph I, 2014. "The untolled problems with airport slot constraints," Economics of Transportation, Elsevier, vol. 3(1), pages 16-28.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nwu:cmsems:1296. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Fran Walker). General contact details of provider: http://edirc.repec.org/data/cmnwuus.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.