A near Pareto optimal auction with budget constraints
In a setup where a divisible good is to be allocated to a set of bidders with budget constraints, we introduce a mechanism in the spirit of the Vickrey auction. In the mechanism we propose, understating budgets or values is weakly dominated. Since the revenue is increasing in budgets and values, all kinds of equilibrium deviations from true valuations turn out to be beneficial to the auctioneer. We also show that ex-post Nash equilibrium of our mechanism is near Pareto optimal in the sense that all full winnersʼ values are above all full losersʼ values.
If 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
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.:
- Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2007.
"Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords,"
American Economic Review,
American Economic Association, vol. 97(1), pages 242-259, March.
- Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2005. "Internet Advertising and the Generalized Second Price Auction: Selling Billions of Dollars Worth of Keywords," NBER Working Papers 11765, National Bureau of Economic Research, Inc.
- Alexey Malakhov & Rakesh Vohra, 2008. "Optimal auctions for asymmetrically budget constrained bidders," Review of Economic Design, Springer;Society for Economic Design, vol. 12(4), pages 245-257, December.
- Jean-Pierre Benoît & Vijay Krishna, 2001. "Multiple-Object Auctions with Budget Constrained Bidders," Review of Economic Studies, Oxford University Press, vol. 68(1), pages 155-179.
- Jean-Pierre Benoit & Vijay Krishna, 1998. "Multiple-Object Auctions with Budget Constrained Bidders," Game Theory and Information 9805001, EconWPA, revised 26 Jul 1999.
- Arieh Gavious & Benny Moldovanu & Aner Sela, 2002. "Bid Costs and Endogenous Bid Caps," RAND Journal of Economics, The RAND Corporation, vol. 33(4), pages 709-722, Winter.
- Gavious, Arieh & Moldovanu, Benny & Sela, Aner, 2000. "Bid costs and endogenous bid caps," Papers 01-19, Sonderforschungsbreich 504.
- Gavious, Arieh & Moldovanu, Benny & Sela, Aner, 2000. "Bid Costs and Endogenous Bid Caps," Sonderforschungsbereich 504 Publications 01-19, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
- Yeon-Koo Che & Ian Gale, 1998. "Standard Auctions with Financially Constrained Bidders," Review of Economic Studies, Oxford University Press, vol. 65(1), pages 1-21.
- 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.
- 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.
- Dobzinski, Shahar & Lavi, Ron & Nisan, Noam, 2012. "Multi-unit auctions with budget limits," Games and Economic Behavior, Elsevier, vol. 74(2), pages 486-503. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:74:y:2012:i:2:p:699-708. 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: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.