IDEAS home Printed from https://ideas.repec.org/p/exe/wpaper/1004.html
   My bibliography  Save this paper

Optimal Allocation without Transfer Payments

Author

Listed:
  • Surajeet Chakravarty

    (Department of Economics, University of Exeter)

  • Todd R. Kaplan

    (Department of Economics, University of Exeter)

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 …nd an optimal mechnnism 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 …nd 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.

Suggested Citation

  • Surajeet Chakravarty & Todd R. Kaplan, 2010. "Optimal Allocation without Transfer Payments," Discussion Papers 1004, University of Exeter, Department of Economics.
  • Handle: RePEc:exe:wpaper:1004
    as

    Download full text from publisher

    File URL: https://exetereconomics.github.io/RePEc/dpapers/DP1004.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    2. Benny Moldovanu & Aner Sela, 2008. "The Optimal Allocation of Prizes in Contests," Springer Books, in: Roger D. Congleton & Arye L. Hillman & Kai A. Konrad (ed.), 40 Years of Research on Rent Seeking 1, pages 615-631, Springer.
    3. McAfee, R Preston & McMillan, John, 1992. "Bidding Rings," American Economic Review, American Economic Association, vol. 82(3), pages 579-599, June.
      • McAfee, R. Preston & McMillan, John., 1990. "Bidding Rings," Working Papers 726, California Institute of Technology, Division of the Humanities and Social Sciences.
    4. 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.
    5. Milgrom,Paul, 2004. "Putting Auction Theory to Work," Cambridge Books, Cambridge University Press, number 9780521536721, October.
    6. Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Kidney Exchange," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 119(2), pages 457-488.
    7. Alvin E. Roth, 2007. "Repugnance as a Constraint on Markets," Journal of Economic Perspectives, American Economic Association, vol. 21(3), pages 37-58, Summer.
    8. Heidrun C. Hoppe & Benny Moldovanu & Aner Sela, 2009. "The Theory of Assortative Matching Based on Costly Signals," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 76(1), pages 253-281.
    9. 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.
    10. McAfee, R. Preston & Miller, Alan D., 2012. "The tradeoff of the commons," Journal of Public Economics, Elsevier, vol. 96(3), pages 349-353.
    11. Jacques Crémer & Yossi Spiegel & Charles Zheng, 2009. "Auctions with costly information acquisition," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 38(1), pages 41-72, January.
    12. 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, February.
    13. 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.
    14. 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-1394, December.
    15. 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.
    16. Holt, Charles A, Jr & Sherman, Roger, 1982. "Waiting-Line Auctions," Journal of Political Economy, University of Chicago Press, vol. 90(2), pages 280-294, April.
    17. 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.
    18. 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.
    19. 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.
    20. 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.
    21. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    22. 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.
    23. 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.
    24. Steven J. Brams & D. Marc Kilgour, 2001. "Competitive Fair Division," Journal of Political Economy, University of Chicago Press, vol. 109(2), pages 418-443, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    2. Daniele Condorelli, 2009. "What money can't buy: allocations with priority lists, lotteries and queues," Discussion Papers 1482, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    4. 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.
    5. 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.
    6. Mohammad Akbarpour & Piotr Dworczak & Scott Duke Kominers, 2024. "Redistributive Allocation Mechanisms," Journal of Political Economy, University of Chicago Press, vol. 132(6), pages 1831-1875.
    7. Condorelli, Daniele, 2013. "Market and non-market mechanisms for the optimal allocation of scarce resources," Games and Economic Behavior, Elsevier, vol. 82(C), pages 582-591.
    8. Alvin E. Roth, 2009. "What Have We Learned from Market Design?," Innovation Policy and the Economy, University of Chicago Press, vol. 9(1), pages 79-112.
    9. Tayfun Sönmez & Tobias B. Switzer, 2013. "Matching With (Branch‐of‐Choice) Contracts at the United States Military Academy," Econometrica, Econometric Society, vol. 81(2), pages 451-488, March.
    10. Kwiek, Maksymilian, 2014. "Efficient voting with penalties," Discussion Paper Series In Economics And Econometrics 1419, Economics Division, School of Social Sciences, University of Southampton.
    11. Tayfun Sönmez, 2013. "Bidding for Army Career Specialties: Improving the ROTC Branching Mechanism," Journal of Political Economy, University of Chicago Press, vol. 121(1), pages 186-219.
    12. E. Feess & Gerd Muehlheusser & M. Walzl, 2008. "Unfair contests," Journal of Economics, Springer, vol. 93(3), pages 267-291, April.
      • Feess, E. & Muehlheusser, G. & Walzl, M., 2004. "Unfair contests," Research Memorandum 048, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    13. Lingbo Huang & Tracy Xiao Liu & Jun Zhang, 2023. "Born to wait? A study on allocation rules in booking systems," Discussion Papers 2023-04, The Centre for Decision Research and Experimental Economics, School of Economics, University of Nottingham.
    14. Gil Epstein & Shmuel Nitzan, 2006. "The Politics of Randomness," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 27(2), pages 423-433, October.
    15. Lorentziadis, Panos L., 2016. "Optimal bidding in auctions from a game theory perspective," European Journal of Operational Research, Elsevier, vol. 248(2), pages 347-371.
    16. Kwiek, Maksymilian, 2017. "Efficient voting with penalties," Games and Economic Behavior, Elsevier, vol. 104(C), pages 468-485.
    17. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.
    18. Robert Kleinberg & Bo Waggoner & E. Glen Weyl, 2016. "Descending Price Optimally Coordinates Search," Papers 1603.07682, arXiv.org, revised Dec 2016.
    19. Moldovanu, Benny & Sela, Aner, 2006. "Contest architecture," Journal of Economic Theory, Elsevier, vol. 126(1), pages 70-96, January.
    20. Marco Faravelli, 2011. "The Important Thing Is Not (Always) Winning but Taking Part: Funding Public Goods with Contests," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 13(1), pages 1-22, February.

    More about this item

    Keywords

    mechanism design; efficient allocation; waiting lines; lotteries; all-pay auctions;
    All these keywords.

    JEL classification:

    • C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • D89 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Other

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:exe:wpaper:1004. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sebastian Kripfganz (email available below). General contact details of provider: https://edirc.repec.org/data/deexeuk.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.