Balanced allocation methods for claims problems with indivisibilities
Tóm tắt
We study claims problems in which a certain amount of indivisible units (of an homogeneous good) has to be distributed among a group of agents, when this amount is not enough to fully satisfy agents’ demands. Our aim is to find solutions fulfilling procedural and fairness properties. To do that, we define the M-down methods, which are the unique robust (composition down and consistency) and fair (balancedness and conditional full compensation) rules. Besides, we also establish the relationship between these M-down methods and the constrained equal awards rule.
Tài liệu tham khảo
Balinski ML, Young HP (1977) On Huntington methods of apportionment. SIAM J Appl Math 33:607–618
Chun Y (1999) Equivalence of axioms for bankruptcy problems. Intl J Game Theory 28:511–520
Herrero C, Villar A (2001) The three musketeers: four classical solutions to bankruptcy problems. Math Soc Sci 42:307–328
Herrero C, Villar A (2002) Sustainability in bankruptcy problems. TOP 10:261–273
Moulin H (2000) Priority rules and other asymmetric rationing methods. Econometrica 68:643–684
Moulin H (2002) Axiomatic cost and surplus-sharing. In: Arrow KJ, Sen AK, Suzumura K (eds) Handbook of social choice and welfare. North-Holland, Amsterdam
Moulin H, Stong R (2002) Fair queuing and other probabilistic allocation methods. Math Operat Res 27:1–30
Thomson W (1998) Consistency and its converse: an introduction. Rochester Center for Economics Research, 448
Thomson W (2003) Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey. Math Soc Sci 45:249–297
Yeh CH (2006) Protective properties and the constrained equal awards rule for claims problems: a note. Social Choice and Welfare 27:221–230
Young HP (1994) Equity: theory and practice. Princeton University Press, Princeton