Max-min fair allocation of indivisible goods

We consider the problem of fairly allocating a set of m indivisible goods to n agents, given the agents’ utilities for each good. Fair allocations in this context are those maximizing the minimum utility received by any agent. We give hardness results and polynomial time approximation algorithms for several variants of this problem. Our main result is a bicriteria approximation in the model with additive utilities, in which a (1− 1 k ) fraction of the agents receive utility at least OPT/k, for any integer k. This result is obtained from rounding a suitable linear programming relaxation of the problem, and is the best possible result for our LP. We also give an O( √ n) approximation for a special case with only two classes of goods, an (m − n + 1) approximation for instances with submodular utilities, and extreme inapproximability results for the most general model with monotone utilities. This research is supported by NSF ITR grants CCR-0122581 and IIS-0121678.

[1]  Nimrod Megiddo,et al.  Optimal flows in networks with multiple sources and sinks , 1974, Math. Program..

[2]  L. Shapley,et al.  On cores and indivisibility , 1974 .

[3]  Marc E. Posner,et al.  Linear max-min programming , 1981, Math. Program..

[4]  Robert W. Irving,et al.  An efficient algorithm for the “optimal” stable marriage , 1987, JACM.

[5]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[6]  Toshihide Ibaraki,et al.  Resource allocation problems - algorithmic approaches , 1988, MIT Press series in the foundations of computing.

[7]  Christopher S. Tang A Max-Min Allocation Problem: Its Solutions and Applications , 1988, Oper. Res..

[8]  D. Gale,et al.  Fair Allocation of Indivisible Goods and Criteria of Justice , 1991 .

[9]  Éva Tardos,et al.  Scheduling unrelated machines with costs , 1993, SODA '93.

[10]  Arnold B. Urken,et al.  Classics of social choice , 1995 .

[11]  Yash P. Aneja,et al.  Lexicographic bottleneck combinatorial problems , 1998, Oper. Res. Lett..

[12]  C. Pearce,et al.  An Efficient Algorithm for the , 1999 .

[13]  Hanan Luss,et al.  On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach , 1999, Oper. Res..

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

[15]  Yuval Rabani,et al.  Fairness in routing and load balancing , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[16]  T. Quint,et al.  On the Shapley–Scarf economy: the case of multiple types of indivisible goods , 2001 .

[17]  Satoru Fujishige,et al.  Existence of an Equilibrium in a General Competitive Exchange Economy with Indivisible Goods and Money , 2002 .

[18]  Xiaotie Deng,et al.  On the complexity of equilibria , 2002, STOC '02.

[19]  Vijay V. Vazirani,et al.  Equitable cost allocations via primal-dual-type algorithms , 2002, STOC '02.

[20]  Nikhil R. Devanur,et al.  Market equilibrium via a primal-dual-type algorithm , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[21]  Noam Nisany,et al.  The Communication Requirements of E¢cient Allocations and Supporting Lindahl Prices¤ , 2003 .

[22]  Marek Karpinski,et al.  Approximation Hardness of Short Symmetric Instances of MAX-3SAT , 2003, Electron. Colloquium Comput. Complex..

[23]  Éva Tardos,et al.  Group strategy proof mechanisms via primal-dual algorithms , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[24]  Vincent Conitzer,et al.  Complexity Results about Nash Equilibria , 2002, IJCAI.

[25]  Amin Saberi,et al.  Approximating Market Equilibria , 2003, RANDOM-APPROX.

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

[27]  Ivona Bezáková,et al.  Allocating indivisible goods , 2005, SECO.

[28]  Ashish Goel,et al.  Approximate majorization and fair online load balancing , 2001, TALG.