The undercut procedure: an algorithm for the envy-free division of indivisible items

We propose a procedure for dividing a set of indivisible items between two players. We assume that each player’s preference over subsets of items is consistent with a strict ranking of the items, and that neither player has information about the other’s preferences. Our procedure ensures an envy-free division—each player receives a subset of items that it values more than the other player’s complementary subset—given that an envy-free division of “contested items,” which the players would choose at the same time, 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 and its envy-free allocation may be Pareto-inferior, each player’s maximin strategy is to be truthful. Applications of the procedure are discussed briefly.

[1]  Steven J. Brams Fair Division* , 2009, Encyclopedia of Complexity and Systems Science.

[2]  William S. Zwicker,et al.  Simple games - desirability relations, trading, pseudoweightings , 1999 .

[3]  W. Bossert,et al.  Ranking Sets of Objects , 2001 .

[4]  P. Hammond,et al.  Handbook of Utility Theory , 2004 .

[5]  D. Marc Kilgour,et al.  Strategic Behavior in Contested-Pile Methods for Fair Division of Indivisible Items , 2013 .

[6]  Steven J. Brams,et al.  Dividing the Indivisible , 2002 .

[7]  D. Foley Resource allocation and the public sector , 1967 .

[8]  Peter C. Fishburn,et al.  FAIR DIVISION OF INDIVISIBLE ITEMS , 2003 .

[9]  Steven J. Brams,et al.  Mathematics and democracy: Designing better voting and fair-division procedures , 2008, Math. Comput. Model..

[10]  S. Brams,et al.  Efficient Fair Division , 2005 .

[11]  Steven J. Brams,et al.  The win-win solution - guaranteeing fair shares to everybody , 1999 .

[12]  Clemens Puppe,et al.  A simple procedure for finding equitable allocations of indivisible goods , 2002, Soc. Choice Welf..

[13]  Barry R. Weingast,et al.  The Oxford Handbook of Political Economy , 2006 .

[14]  S. Brams,et al.  Prisoners' Dilemma and Professional Sports Drafts , 1979 .

[15]  Peter C. Fishburn,et al.  Fair division of indivisible items among people with similar preferences , 2001, Math. Soc. Sci..

[16]  S. Brams,et al.  Competitive Fair Division , 2001, Journal of Political Economy.

[17]  H. Raiffa,et al.  The art and science of negotiation , 1983 .

[18]  Peter C. Fishburn,et al.  Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity , 2000, Soc. Choice Welf..

[19]  Steven J. Brams,et al.  Fair division - from cake-cutting to dispute resolution , 1998 .

[20]  Peter C. Fishburn,et al.  Paradoxes of Fair Division , 2001 .