Skip to main content
Log in

Probabilistic assignment of indivisible goods with single-peaked preferences

  • Original Paper
  • Published:
Social Choice and Welfare Aims and scope Submit manuscript

Abstract

We consider the problem of assigning indivisible goods among a group of agents with lotteries when the preference profile is single-peaked. Unfortunately, even on this restricted domain of preferences, equal treatment of equals, stochastic dominance efficiency, and stochastic dominance strategy-proofness are incompatible.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Abdulkadiroğlu A, Sönmez T (1998) Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica 66: 689–701

    Article  Google Scholar 

  • Birkhoff G (1946) Three observations on linear algebra. Univ. Nac. Tucumán. Revista A.5: 147–151 (in Spanish)

    Google Scholar 

  • Bogomolnaia A, Moulin H (2001) A new solution to the random assignment problem. J Econ Theory 100: 295–328

    Article  Google Scholar 

  • Bogomolnaia A, Moulin H (2002) A simple random assignment problem with a unique solution. Econ Theory 19: 623–635

    Article  Google Scholar 

  • Che Y-K, Kojima F (2010) Asymptotic equivalence of probabilistic serial and random priority mechanisms. Econometrica 78: 1625–1672

    Article  Google Scholar 

  • Crès H, Moulin H (2001) Scheduling with opting out: improving upon random priority. Oper Res 49: 565–577

    Article  Google Scholar 

  • Ehlers L, Klaus B (2003) Probabilistic assignments of identical indivisible objects and uniform probabilistic rules. Rev Econ Des 8: 249–268

    Google Scholar 

  • Gibbard A (1977) Manipulation of schemes that mix voting with chance. Econometrica 45: 665–681

    Article  Google Scholar 

  • Hatsumi K, Serizawa S (2009) Coalitionally strategy-proof rules in allotment economies with homogeneous indivisible goods. Soc Choice Welf 33: 423–447

    Article  Google Scholar 

  • Heo E-J (2011) Probabilistic assignment problem with multiple demands: a generalization of the serial rule and a characterization, Mimeo

  • Hylland A, Zeckhauser R (1979) The efficient allocation of individuals to positions. J Political Econ 87: 293–314

    Article  Google Scholar 

  • Katta A-K, Sethuraman J (2006) A solution to the random assignment problem on the full preference domain. J Econ Theory 131: 231–250

    Article  Google Scholar 

  • Kojima F (2009) Random assignment of multiple indivisible objects. Math Soc Sci 57: 134–142

    Article  Google Scholar 

  • Kojima F, Manea M (2010) Incentives in the probabilistic serial mechanism. J Econ Theory 145: 106–123

    Article  Google Scholar 

  • Kureishi W, Mizukami H (2007) Equal probability for the best and the assignment of identical indivisible objects. Econ Bull 4: 1–10

    Article  Google Scholar 

  • Sasaki H (1997) Randomized uniform allocation mechanism and single-peaked preferences of indivisible good, Working Paper, Waseda University

  • Thomson W (2008) Strategy-proof allocation rules, Mimeo

  • von Neumann J (1953). A certain zero-sum two-person game equivalent to the optimal assignment problem. In: Kuhn HW, Tucker AW (eds) Contributions to the theory of games, vol 2. Princeton University press, Princeton, pp 5–12

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yoichi Kasajima.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kasajima, Y. Probabilistic assignment of indivisible goods with single-peaked preferences. Soc Choice Welf 41, 203–215 (2013). https://doi.org/10.1007/s00355-012-0674-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00355-012-0674-2

Keywords

Navigation