This article is based on the Fisher–Schultz Lecture presented at the 2004 Econometric Society European Meeting. This paper has benefited from the suggestions of many people. Special thanks to Dan Quint, John Hegeman, the editor, and the referees for their detailed comments. Financial support for this research was provided by the National Science Foundation under grant ITR-0427770.
Package Auctions and Exchanges
Article first published online: 15 JUN 2007
Volume 75, Issue 4, pages 935–965, July 2007
How to Cite
Milgrom, P. (2007), Package Auctions and Exchanges. Econometrica, 75: 935–965. doi: 10.1111/j.1468-0262.2007.00778.x
- Issue published online: 15 JUN 2007
- Article first published online: 15 JUN 2007
- Manuscript received August, 2005; final revision received September, 2006.
- Combinatorial bidding;
- package auction;
- stable match;
We report recent advances concerning the package allocation problem, in which traders seek to buy or sell combinations of goods. The problems are most difficult when some goods are not substitutes. In that case, competitive equilibrium typically fail to exist but the core is non-empty and comprises the competitive solutions. Also in that case, the Vickrey auction fails to select core allocations and yield revenues that are less than competitive. The Ausubel-Milgrom auction generally selects core allocations and, when goods are substitutes, prescribes the Vickrey allocation. We also evaluate the problems and promise of mechanisms for the package exchange problem.