The undercut procedure: an algorithm for the envy-free division of indivisible items
We propose a procedure for dividing indivisible items between two players in which each player ranks the items from best to worst and has no information about the other player’s ranking. It ensures that each player receives a subset of items that it values more than the other player’s complementary subset, given that such an envy-free division is possible. We show that the possibility of one player’s undercutting the other’s proposal, and implementing the reduced subset for himself or herself, makes the proposer “reasonable” and generally leads to an envy-free division, even when the players rank items exactly the same. Although the undercut procedure is manipulable, each player’s maximin strategy is to be truthful. Applications of the undercut procedure are briefly discussed.
|Date of creation:||Jan 2009|
|Date of revision:|
|Contact details of provider:|| Postal: Ludwigstraße 33, D-80539 Munich, Germany|
Web page: https://mpra.ub.uni-muenchen.de
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Steven J. Brams & Paul H. Edelman & Peter C. Fishburn, 2003.
"Fair Division Of Indivisible Items,"
Theory and Decision,
Springer, vol. 55(2), pages 147-180, 09.
- Weingast, Barry R. & Wittman, Donald, 2008. "The Oxford Handbook of Political Economy," OUP Catalogue, Oxford University Press, number 9780199548477, May.
- I. D. Hill, 2008. "Mathematics and Democracy: Designing Better Voting and Fair-division Procedures," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 171(4), pages 1032-1033.
- Brams, S.J. & Kilgour, D.M., 1999.
"Competitive Fair Division,"
99-05, C.V. Starr Center for Applied Economics, New York University.
- Brams,S.L. & Kaplan,T.R., 2002.
"Dividing the indivisible : procedures for allocating cabinet ministries to political parties in a parliamentary system,"
Center for Mathematical Economics Working Papers
340, Center for Mathematical Economics, Bielefeld University.
- Brams, S.J. & Kaplan, T.R., 2002. "Dividing the Indivisible: Procedures for Allocating Cabinet Ministries to Political Parties in a Parliamentary System," Working Papers 02-06, C.V. Starr Center for Applied Economics, New York University.
- Steven J. Brams & Todd R. Kaplan, 2002. "Dividing the Indivisible: Procedures for Allocating Cabinet Ministries to Political Parties in a Parliamentary System," Discussion Papers 0202, Exeter University, Department of Economics.
- Brams, S.J. & Fishburn, P.C., 1998.
"Fair Division of Indivisible Items between Two People with Identical Preferences: Envy-Freeness, Pareto-Optimality, and Equity,"
98-20, C.V. Starr Center for Applied Economics, New York University.
- Steven J. Brams & Peter C. Fishburn, 2000. "Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity," Social Choice and Welfare, The Society for Social Choice and Welfare, vol. 17(2), pages 247-267.
- Edelman, Paul & Fishburn, Peter, 2001. "Fair division of indivisible items among people with similar preferences," Mathematical Social Sciences, Elsevier, vol. 41(3), pages 327-347, May.
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:12774. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joachim Winter)
If references are entirely missing, you can add them using this form.