Market and non-market mechanisms for the optimal allocation of scarce resources
A number of identical objects is allocated to a set of privately informed agents. Agents have linear utility in money. The designer wants to assign objects to agents that possess specific traits, but the allocation can only be conditioned on the willingness to pay and on observable characteristics. I solve for the optimal mechanism. The choice between market or non-market mechanisms depends on the statistical linkage between characteristics valued by the designer and willingness to pay.
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.:
- Paul Klemperer, 2004.
"Introduction to Auctions: Theory and Practice
[Auctions: Theory and Practice]," Introductory Chapters, Princeton University Press.
- Charles Zhoucheng Zheng, 2002.
"Optimal Auction with Resale,"
Econometric Society, vol. 70(6), pages 2197-2224, November.
- Alvin E. Roth, 2006.
"Repugnance as a Constraint on Markets,"
321307000000000629, UCLA Department of Economics.
- Condorelli, Daniele, 2012. "What money canʼt buy: Efficient mechanism design with costly signals," Games and Economic Behavior, Elsevier, vol. 75(2), pages 613-624.
- Paul Klemperer, 2004.
"Auctions: Theory and Practice,"
Economics Series Working Papers
2004-W09, University of Oxford, Department of Economics.
- McMillan, John, 1995. "Why auction the spectrum?," Telecommunications Policy, Elsevier, vol. 19(3), pages 191-199, April.
- Dobzinski, Shahar & Lavi, Ron & Nisan, Noam, 2012. "Multi-unit auctions with budget limits," Games and Economic Behavior, Elsevier, vol. 74(2), pages 486-503.
- Eric Budish, 2011. "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes," Journal of Political Economy, University of Chicago Press, vol. 119(6), pages 1061 - 1103.
- repec:cup:cbooks:9780521536721 is not listed on IDEAS
- Yeon-Koo Che & Ian Gale & Jinwoo Kim, 2013. "Assigning Resources to Budget-Constrained Agents," Review of Economic Studies, Oxford University Press, vol. 80(1), pages 73-107.
- Hakenes, Hendrik & Schnabel, Isabel, 2000.
"License Auctions and Market Structure,"
Sonderforschungsbereich 504 Publications
01-21, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
- repec:cup:cbooks:9780521551847 is not listed on IDEAS
- Preston McAfee, R., 1992. "Amicable divorce: Dissolving a partnership with simple mechanisms," Journal of Economic Theory, Elsevier, vol. 56(2), pages 266-293, April.
- Evans, Mary F. & Vossler, Christian A. & Flores, Nicholas E., 2009. "Hybrid allocation mechanisms for publicly provided goods," Journal of Public Economics, Elsevier, vol. 93(1-2), pages 311-325, February.
- Gary S. Becker & Julio Jorge El�as, 2007. "Introducing Incentives in the Market for Live and Cadaveric Organ Donations," Journal of Economic Perspectives, American Economic Association, vol. 21(3), pages 3-24, Summer.
- Krishna, Vijay & Maenner, Eliot, 2001. "Convex Potentials with an Application to Mechanism Design," Econometrica, Econometric Society, vol. 69(4), pages 1113-19, July.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:82:y:2013:i:c:p:582-591. 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: (Zhang, Lei)
If references are entirely missing, you can add them using this form.