Optimal allocation without transfer payments

Surajeet Chakravarty, Todd R. Kaplan

Research output: Contribution to journalArticlepeer-review

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. 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.

Original languageEnglish
Pages (from-to)1-20
Number of pages20
JournalGames and Economic Behavior
Volume77
Issue number1
DOIs
StatePublished - Jan 2013

Keywords

  • Allocation
  • Mechanism design

All Science Journal Classification (ASJC) codes

  • Finance
  • Economics and Econometrics

Fingerprint

Dive into the research topics of 'Optimal allocation without transfer payments'. Together they form a unique fingerprint.

Cite this