Optimal allocation without transfer payments
Often an organization or government must allocate goods without collecting payment in return. This may pose a difficult problem either when agents receiving those goods have private information in regards to their values or needs. In this paper, we find an optimal mechanism to allocate goods when the designer is benevolent. While the designer cannot charge agents, he can receive a costly but wasteful signal from them. We find conditions for cases in which ignoring these costly signals by giving agents equal share (or using lotteries if the goods are indivisible) is optimal. In other cases, those that send the highest signal should receive the goods; however, we then show that there exist cases where more complicated mechanisms are superior. Also, we show that the optimal mechanism is independent of the scarcity of the goods being allocated.
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.:
- Tayfun Sönmez & M. Utku Ünver, 2010.
"Course Bidding At Business Schools,"
International Economic Review,
Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 51(1), pages 99-123, 02.
- Tayfun Sonmez & M. Utku Unver, 2003. "Course Bidding at Business Schools," Game Theory and Information 0306001, EconWPA, revised 02 Jan 2004.
- Tayfun Sönmez & M. Utku Ünver, 2005. "Course Bidding at Business Schools," Boston College Working Papers in Economics 618, Boston College Department of Economics.
- Jacques Crémer & Yossi Spiegel & Charles Zheng, 2009.
"Auctions with costly information acquisition,"
Springer;Society for the Advancement of Economic Theory (SAET), vol. 38(1), pages 41-72, January.
- 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.
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2003.
NBER Working Papers
10002, National Bureau of Economic Research, Inc.
- Heidrun C. Hoppe & Benny Moldovanu & Aner Sela, 2009.
"The Theory of Assortative Matching Based on Costly Signals,"
Review of Economic Studies,
Oxford University Press, vol. 76(1), pages 253-281.
- Hoppe, Heidrun C. & Moldovanu, Benny & Sela, Aner, 2005. "The Theory of Assortative Matching Based on Costly Signals," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 85, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
- Hoppe, Heidrun C. & Moldovanu, Benny & Sela, Aner, 2006. "The Theory of Assortative Matching Based on Costly Signals," CEPR Discussion Papers 5543, C.E.P.R. Discussion Papers.
- 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.
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2004.
"Pairwise Kidney Exchange,"
122247000000000350, UCLA Department of Economics.
- Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Pairwise Kidney Exchange," Boston College Working Papers in Economics 620, Boston College Department of Economics.
- Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Pairwise Kidney Exchange," Game Theory and Information 0408001, EconWPA, revised 16 Feb 2005.
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2004. "Pairwise Kidney Exchange," NBER Working Papers 10698, National Bureau of Economic Research, Inc.
- McAfee, R. Preston & Miller, Alan D., 2012.
"The tradeoff of the commons,"
Journal of Public Economics,
Elsevier, vol. 96(3), pages 349-353.
- Holt, Charles A, Jr & Sherman, Roger, 1982. "Waiting-Line Auctions," Journal of Political Economy, University of Chicago Press, vol. 90(2), pages 280-94, April.
- Taylor, Grant A. & Tsui, Kevin K. K. & Zhu, Lijing, 2003. "Lottery or waiting-line auction?," Journal of Public Economics, Elsevier, vol. 87(5-6), pages 1313-1334, May.
- Roth, Alvin, 2007.
"Repugnance as a Constraint on Markets,"
2624677, Harvard University Department of Economics.
- Richard L. Fullerton & R. Preston McAfee, 1999. "Auctioning Entry into Tournaments," Journal of Political Economy, University of Chicago Press, vol. 107(3), pages 573-605, June.
- Brams, S.J. & Kilgour, D.M., 1999.
"Competitive Fair Division,"
99-05, C.V. Starr Center for Applied Economics, New York University.
- Barzel, Yoram, 1974. "A Theory of Rationing by Waiting," Journal of Law and Economics, University of Chicago Press, vol. 17(1), pages 73-95, April.
- McAfee, R. Preston & McMillan, John., 1990.
726, California Institute of Technology, Division of the Humanities and Social Sciences.
- Milgrom,Paul, 2004.
"Putting Auction Theory to Work,"
Cambridge University Press, number 9780521536721, Junio.
- Benny Moldovanu & Aner Sela, 2001.
"The Optimal Allocation of Prizes in Contests,"
American Economic Review,
American Economic Association, vol. 91(3), pages 542-558, June.
- Ledyard, John O. & Palfrey, Thomas R., 2007.
"A general characterization of interim efficient mechanisms for independent linear environments,"
Journal of Economic Theory,
Elsevier, vol. 133(1), pages 441-466, March.
- Ledyard, John & Palfrey, Thomas, 2003. "A general characterization of interim efficient mechanisms for independent linear environments," Working Papers 1186, California Institute of Technology, Division of the Humanities and Social Sciences.
- Winston Koh & Zhenlin Yang & Lijing Zhu, 2006. "Lottery Rather than Waiting-line Auction," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 27(2), pages 289-310, October.
- Yoon, Kiho, 2011.
"Optimal mechanism design when both allocative inefficiency and expenditure inefficiency matter,"
Journal of Mathematical Economics,
Elsevier, vol. 47(6), pages 670-676.
- Jacob K. Goeree & Emiel Maasland & Sander Onderstal & John L. Turner, 2005. "How (Not) to Raise Money," Journal of Political Economy, University of Chicago Press, vol. 113(4), pages 897-926, August.
- Suen, Wing, 1989. "Rationing and Rent Dissipation in the Presence of Heterogeneous Individuals," Journal of Political Economy, University of Chicago Press, vol. 97(6), pages 1384-94, December.
- Hillman, Arye L. & Swan, Peter L., 1983. "Participation rules for Pareto-optimal clubs," Journal of Public Economics, Elsevier, vol. 20(1), pages 55-76, February.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:77:y:2013:i:1:p:1-20. 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: (Shamier, Wendy)
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.