- Peter Cramton() (University of Maryland)Yoav Shoham() (Stanford University)Richard Steinberg() (University of Cambridge)Registered editor(s):
The 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.
To 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.
- Kazuo Murota & Akiyoshi Shioura & Zaifu Yang, 2014. "Time Bounds for Iterative Auctions: A Unified Approach by Discrete Convex Analysis," Discussion Papers 14/27, Department of Economics, University of York.
- Lars Ehlers & Isa E. Hafalir & M. Bumin Yenmez & Muhammed A. Yildirim, 2011.
"School Choice with Controlled Choice Constraints: Hard Bounds versus Soft Bounds,"
Cahiers de recherche
13-2011, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
- Ehlers, Lars & Hafalir, Isa E. & Yenmez, M. Bumin & Yildirim, Muhammed A., 2014. "School choice with controlled choice constraints: Hard bounds versus soft bounds," Journal of Economic Theory, Elsevier, vol. 153(C), pages 648-683.
- EHLERS, Lars & HAFALIR, Isa E. & YENMEZ, M. Bumin & YILDIRIM, Muhammed A., 2011. "School Choice with Controlled Choice Constraints: Hard Bounds versus Soft Bounds," Cahiers de recherche 2011-08, Universite de Montreal, Departement de sciences economiques.
- Lars Ehlers & Isa Hafalir & Bumin Yenmez & Muhammed Yildirim, 2011. "School Choice with Controlled Choice Constraints: Hard Bounds versus Soft Bounds," GSIA Working Papers 2012-E20, Carnegie Mellon University, Tepper School of Business.
- Lars Ehlers & Isa Hafalir & Bumin Yenmez & Muhammed Yildirim, 2011. "School Choice with Controlled Choice Constraints: Hard Bounds versus Soft Bounds," GSIA Working Papers 2012-E21, Carnegie Mellon University, Tepper School of Business.
- Paul Milgrom, 2009.
"Assignment Messages and Exchanges,"
American Economic Journal: Microeconomics,
American Economic Association, vol. 1(2), pages 95-113, August.
- 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,"
08-023, Stanford Institute for Economic Policy Research.
When requesting a correction, please mention this item's handle: RePEc:mtp:titles:0262033429. 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: (Jake Furbush)
If references are entirely missing, you can add them using this form.
Follow series, journals, authors & more
New papers by email
Subscribe to new additions to RePEc
Public profiles for Economics researchers
Various rankings of research in Economics & related fields
Who was a student of whom, using RePEc
Curated articles & papers various economics topics
Blog aggregator for economics research
Cases of plagiarism in Economics
Job Market Papers
RePEc working paper series dedicated to the job market
Pretend you are at the helm of an economics department
Services from the StL Fed
Data, research, apps & more from the St. Louis Fed