A general branch-and-bound algorithm for fair division problems

In this paper, we introduce a branch-and-bound algorithm for solving fair division problems with indivisible items. Unlike similar algorithms for this problem, our algorithm is applicable to a wide class of possible fairness criteria. Computational results show that the algorithm exhibits very good performance for a considerable number of problem instances. Main applications of the algorithm are seen in computational studies of fairness criteria and fair division problems. In these problems, a relatively small number of items is considered, so an exact algorithm can be used even though the problem is a generalization of the set partitioning problem, which is NP-complete. An exemplary study comparing Max-min and Nash bargaining solutions to the fair division problem illustrates the use of the algorithm.

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

[2]  Paul-Amaury Matt,et al.  Egalitarian Allocations of Indivisible Resources: Theory and Computation , 2006, CIA.

[3]  Amit Kumar,et al.  Fairness measures for resource allocation , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

[5]  Dritan Nace,et al.  Max-min fairness in multi-commodity flows , 2008, Comput. Oper. Res..

[6]  Cristopher Moore,et al.  Computational Complexity and Statistical Physics , 2006, Santa Fe Institute Studies in the Sciences of Complexity.

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

[8]  Felix A. Fischer,et al.  Cooperative Information Agents XI , 2008 .

[9]  Felix A. Fischer,et al.  An integrated framework for adaptive reasoning about conversation patterns , 2005, AAMAS '05.

[10]  Tapan Mitra,et al.  Resource allocation in non-Walrasian environments: Some analytical and simulation results , 1991 .

[11]  Chae Y. Lee,et al.  A lexicographically fair allocation of discrete bandwidth for multirate multicast traffics , 2004, Comput. Oper. Res..

[12]  Stephan Mertens.  The Easiest Hard Problem: Number Partitioning , 2006, Computational Complexity and Statistical Physics.

[13]  Brian Hayes,et al.  The Easiest Hard Problem , 2002, American Scientist.

[14]  D. Golovin.  Max-min fair allocation of indivisible goods , 2005 .

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

[16]  Moshe Zukerman,et al.  To be fair or efficient or a bit of both , 2008, Comput. Oper. Res..

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

[18]  J. Nash.  THE BARGAINING PROBLEM , 1950, Classics in Game Theory.

[19]  Peter Triantafillou,et al.  Fair Resource Allocation in a Simple Multi-agent Setting: Search Algorithms and Experimental Evaluation , 2005, Int. J. Artif. Intell. Tools.

[20]  Jérôme Lang,et al.  Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity , 2005, IJCAI.

[21]  Chun-Yuan Cheng,et al.  Generating correlated random variates based on an analogy between correlation and force , 1994, Proceedings of Winter Simulation Conference.

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

[23]  Eiichi Miyagawa,et al.  Strategy-proofness, solidarity, and consistency for multiple assignment problems , 2002, Int. J. Game Theory.

[24]  Raffaele Mosca,et al.  How to allocate hard candies fairly , 2007, Math. Soc. Sci..

[25]  Yann Chevaleyre,et al.  Issues in Multiagent Resource Allocation , 2006, Informatica.

[26]  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..

[27]  Steven J. Brams,et al.  The undercut procedure: an algorithm for the envy-free division of indivisible items , 2009, Soc. Choice Welf..

[28]  Jérôme Lang,et al.  Allocation of indivisible goods: a general model and some complexity results , 2005, AAMAS '05.

[29]  Elchanan Mossel,et al.  On approximately fair allocations of indivisible goods , 2004, EC '04.