Optimal Allocation without Transfer Payments
Surajeet Chakravarty and
Todd Kaplan
MPRA Paper from University Library of Munich, Germany
Abstract:
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 or when discriminating among agents using known differences is not a viable option. 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 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. Finally, we show that the optimal mechanism is independent of the scarcity of the goods being allocated.
Keywords: mechanism design; efficient allocation; waiting lines; lotteries; all-pay auctions (search for similar items in EconPapers)
JEL-codes: C70 D44 D82 (search for similar items in EconPapers)
Date: 2006-10-24, Revised 2009-03-02
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)
Downloads: (external link)
https://mpra.ub.uni-muenchen.de/18481/1/MPRA_paper_18481.pdf original version (application/pdf)
Related works:
Journal Article: Optimal allocation without transfer payments (2013) 
Working Paper: Optimal Allocation without Transfer Payments (2010) 
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:18481
Access Statistics for this paper
More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().