• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Combinatorial auctions: A survey (2000)

Cached

  • Download as a PDF

Download Links

  • [www.kellogg.northwestern.edu]
  • [www.kellogg.northwestern.edu]
  • [www.cs.berkeley.edu]
  • [ima.umn.edu]
  • [www.cs.huji.ac.il]
  • [www.ima.umn.edu]
  • [www.cis.upenn.edu]
  • [redesign.ima.umn.edu]
  • [silver.ima.umn.edu]
  • [www-lit.ma.tum.de]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Sven De Vries , Rakesh Vohra
Citations:212 - 1 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Vries00combinatorialauctions:,
    author = {Sven De Vries and Rakesh Vohra},
    title = {Combinatorial auctions: A survey},
    year = {2000}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Many auctions involve the sale of a variety of distinct assets. Examples are airport time slots, delivery routes and furniture. Because of complementarities (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

Keyphrases

combinatorial auction    different asset    airport time slot    many auction    substitution effect    economic efficiency    delivery route    particular item    integer programming    distinct asset   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University