Multi-unit auctions with budget limits
AbstractWe study multi-unit auctions for bidders that have a budget constraint, a situation very common in practice that has received relatively little attention in the auction theory literature. Our main result is an impossibility: there is no deterministic auction that (1) is individually rational and dominant-strategy incentive-compatible, (2) makes no positive transfers, and (3) always produces a Pareto optimal outcome. In contrast, we show that Ausubelʼs “clinching auction” satisfies all these properties when the budgets are public knowledge. Moreover, we prove that the “clinching auction” is the unique auction that satisfies all these properties when there are two players. This uniqueness result is the cornerstone of the impossibility result. Few additional related results are given, including some results on the revenue of the clinching auction and on the case where the items are divisible.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 74 (2012)
Issue (Month): 2 ()
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Multi-unit auctions; Budget constraints; Pareto optimality;
Find related papers by JEL classification:
- C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
- D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
- D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Maskin, Eric S., 2000. "Auctions, development, and privatization: Efficient auctions with liquidity-constrained buyers," European Economic Review, Elsevier, vol. 44(4-6), pages 667-681, May.
- Ashlagi Itai & Braverman Mark & Hassidim Avinatan & Lavi Ron & Tennenholtz Moshe, 2010. "Position Auctions with Budgets: Existence and Uniqueness," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 10(1), pages 1-32, May.
- Paul Milgrom, 2003.
"Matching with Contracts,"
03003, Stanford University, Department of Economics.
- Benoit, Jean-Pierre & Krishna, Vijay, 2001.
"Multiple-Object Auctions with Budget Constrained Bidders,"
Review of Economic Studies,
Wiley Blackwell, vol. 68(1), pages 155-79, January.
- Jean-Pierre Benoit & Vijay Krishna, 1998. "Multiple-Object Auctions with Budget Constrained Bidders," Game Theory and Information 9805001, EconWPA, revised 26 Jul 1999.
- Budish, Eric & Cantillon, Estelle, 2010.
"The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard,"
CEPR Discussion Papers
7641, C.E.P.R. Discussion Papers.
- Eric Budish & Estelle Cantillon, 2012. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," American Economic Review, American Economic Association, vol. 102(5), pages 2237-71, August.
- Eric Budish & Estelle Cantillon, 2012. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," ULB Institutional Repository 2013/99376, ULB -- Universite Libre de Bruxelles.
- Lawrence M. Ausubel, 2004. "An Efficient Ascending-Bid Auction for Multiple Objects," American Economic Review, American Economic Association, vol. 94(5), pages 1452-1475, December.
- Laffont, Jean-Jacques & Robert, Jacques, 1996. "Optimal auction with financially constrained buyers," Economics Letters, Elsevier, vol. 52(2), pages 181-186, August.
- Mallesh M. Pai & Rakesh Vohra, 2008. "Optimal Auctions with Financially Constrained Bidders," Discussion Papers 1471, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Motty Perry & Philip J. Reny, 2005. "An Efficient Multi-Unit Ascending Auction," Review of Economic Studies, Oxford University Press, vol. 72(2), pages 567-592.
- Paul Milgrom & Ilya Segal, 2002. "Envelope Theorems for Arbitrary Choice Sets," Econometrica, Econometric Society, vol. 70(2), pages 583-601, March.
- Che, Yeon-Koo & Gale, Ian, 1998. "Standard Auctions with Financially Constrained Bidders," Review of Economic Studies, Wiley Blackwell, vol. 65(1), pages 1-21, January.
- Debasis Mishra & David C. Parkes, 2007.
"Multi-item Vickrey-Dutch auctions,"
Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers
07-04, Indian Statistical Institute, New Delhi, India.
- John Hatfield, 2009. "Strategy-proof, efficient, and nonbossy quota allocations," Social Choice and Welfare, Springer, vol. 33(3), pages 505-515, September.
- Goldberg, Andrew V. & Hartline, Jason D. & Karlin, Anna R. & Saks, Michael & Wright, Andrew, 2006. "Competitive auctions," Games and Economic Behavior, Elsevier, vol. 55(2), pages 242-269, May.
- Sushil Bikhchandani & Shurojit Chatterji & Ron Lavi & Ahuva Mu'alem & Noam Nisan & Arunava Sen, 2006. "Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation," Econometrica, Econometric Society, vol. 74(4), pages 1109-1132, 07.
- Sandro Brusco & Giuseppe Lopomo, 2004. "Simultaneous Ascending Bid Auctions with Privately Known Budget Constraints," Levine's Bibliography 122247000000000373, UCLA Department of Economics.
- Hafalir, Isa E. & Ravi, R. & Sayedi, Amin, 2012. "A near Pareto optimal auction with budget constraints," Games and Economic Behavior, Elsevier, vol. 74(2), pages 699-708.
- Lavi, Ron & May, Marina, 2012. "A note on the incompatibility of strategy-proofness and Pareto-optimality in quasi-linear settings with public budgets," Economics Letters, Elsevier, vol. 115(1), pages 100-103.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If references are entirely missing, you can add them using this form.