BUDGET CONSTRAINTS AND DEMAND REDUCTION IN SIMULTANEOUS ASCENDING-BID AUCTIONS -super-*
AbstractThe possibility, even if arbitrarily small, of binding budget constraints in simultaneous ascending bid auctions induces strategic demand reduction and generates significant inefficiencies. Under mild conditions on the distributions of the bidders' values, unconstrained bidders behave as if they were liquidity constrained, even as the probability that bidders are budget constrained goes to zero. Copyright 2008 The Authors.
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.
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.
Bibliographic InfoArticle provided by Wiley Blackwell in its journal The Journal of Industrial Economics.
Volume (Year): 56 (2008)
Issue (Month): 1 (03)
Contact details of provider:
Web page: http://www.blackwellpublishing.com/journal.asp?ref=0022-1821
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Gerard van der Laan & Zaifu Yang, 2011.
"An Ascending Multi-Item Auction with Financially Constrained Bidders,"
11/04, Department of Economics, University of York.
- Gerard van der Laan & Zaifu Yang, 2008. "An Ascending Multi-Item Auction with Financially Constrained Bidders," Tinbergen Institute Discussion Papers 08-017/1, Tinbergen Institute.
- Aner Sela & Reut Megidish, 2012. "Sequential Contests With Synergy And Budget Constraints," Working Papers 1212, Ben-Gurion University of the Negev, Department of Economics.
- Kai Konrad, 2012.
"Information alliances in contests with budget limits,"
Springer, vol. 151(3), pages 679-693, June.
- Konrad, Kai A., 2010. "Information alliances in contests with budget limits," Discussion Papers, Research Professorship & Project "The Future of Fiscal Federalism" SP II 2010-21, Social Science Research Center Berlin (WZB).
- Megidish, Reut & Sela, Aner, 2011. "Sequential Contests with Synergy and Budget Constraints," CEPR Discussion Papers 8383, C.E.P.R. Discussion Papers.
- Sandro Brusco & Giuseppe Lopomo & Leslie M. Marx, 2011.
"The Economics of Contingent Re-auctions,"
American Economic Journal: Microeconomics,
American Economic Association, vol. 3(2), pages 165-93, May.
- Alexey Malakhov & Rakesh Vohra, 2008. "Optimal auctions for asymmetrically budget constrained bidders," Review of Economic Design, Springer, vol. 12(4), pages 245-257, December.
- Talman, A.J.J. & Yang, Z.F., 2011. "An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders," Discussion Paper 2011-096, Tilburg University, Center for Economic Research.
- Dolf Talman & Zaifu Yang, 2013. "An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders," Discussion Papers 13/31, Department of Economics, University of York.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wiley-Blackwell Digital Licensing) or (Christopher F. Baum).
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.