Additional information is available for the following registered editor(s):
AbstractThe study of combinatorial auctions -- auctions in which bidders can bid on combinations of items or "packages" -- draws on the disciplines of economics, operations research, and computer science. This landmark collection integrates these three perspectives, offering a state-of-the art survey of developments in combinatorial auction theory and practice by leaders in the field. Combinatorial auctions (CAs), by allowing bidders to express their preferences more fully, can lead to improved economic efficiency and greater auction revenues. However, challenges arise in both design and implementation. Combinatorial Auctions addresses each of these challenges. After describing and analyzing various CA mechanisms, the book addresses bidding languages and questions of efficiency. Possible strategies for solving the computationally intractable problem of how to compute the objective-maximizing allocation (known as the winner determination problem) are considered, as are questions of how to test alternative algorithms. The book discusses five important applications of CAs: spectrum auctions, airport takeoff and landing slots, procurement of freight transportation services, the London bus routes market, and industrial procurement. This unique collection makes recent work in CAs available to a broad audience of researchers and practitioners. The integration of work from the three disciplines underlying CAs, using a common language throughout, serves to advance the field in theory and practice.
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Bibliographic InfoThis book is provided by The MIT Press in its series MIT Press Books with number 0262033429 and published in 2006.
Contact details of provider:
Web page: http://mitpress.mit.edu
combinatorial auctions; spectrum auctions; transportation; bidding languages;
Find related papers by JEL classification:
- D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
- Jeremy Bulow & Jonathan Levin & Paul Milgrom, 2009.
"Winning Play in Spectrum Auctions,"
NBER Working Papers
14765, National Bureau of Economic Research, Inc.
- Paul Milgrom, 2009.
"Assignment Messages and Exchanges,"
American Economic Journal: Microeconomics,
American Economic Association, vol. 1(2), pages 95-113, August.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Jake Furbush).
If references are entirely missing, you can add them using this form.