Combinatorial auctions: A survey (2000)
Cached
Download Links
- [www.kellogg.northwestern.edu]
- [www.cs.berkeley.edu]
- [ima.umn.edu]
- [www.cs.huji.ac.il]
- [www.ima.umn.edu]
- [www.cis.upenn.edu]
- [www-lit.ma.tum.de]
- DBLP
Other Repositories/Bibliography
| Citations: | 138 - 1 self |
BibTeX
@MISC{Vries00combinatorialauctions:,
author = {Sven De Vries and Rakesh Vohra},
title = {Combinatorial auctions: A survey},
year = {2000}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
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
