An approximation algorithm for max-min fair allocation of indivisible goods

In this paper we give the first approximation algorithm for the problem of max-min fair allocation of indivisible goods. The approximation ratio of our algorithm is Ω1√k log3 k. As a part of our algorithm, we design an iterative method for rounding a fractional matching on a tree which might be of independent interest.

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

[2]  Uriel Feige,et al.  On allocations that maximize fairness , 2008, SODA '08.

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

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

[5]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

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

[7]  E. Jaynes.  Information Theory and Statistical Mechanics , 1957 .

[8]  M. Tribus,et al.  Probability theory: the logic of science , 2003 .

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

[10]  Sanjeev Khanna,et al.  On Allocating Goods to Maximize Fairness , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

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

[12]  Fan Chung Graham,et al.  Coupling Online and Offline Analyses for Random Power Law Graphs , 2004, Internet Math..

[13]  Venkatesan Guruswami,et al.  MaxMin allocation via degree lower-bounded arborescences , 2009, STOC '09.

[14]  Nikhil Bansal,et al.  The Santa Claus problem , 2006, STOC '06.

[15]  Vahab S. Mirrokni,et al.  Tight approximation algorithms for maximum general assignment problems , 2006, SODA '06.

[16]  Alan M. Frieze,et al.  A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 2002, Math. Program..

[17]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[18]  N. Alon,et al.  The Probabilistic Method, Second Edition , 2000 .

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

[20]  Subhash Khot,et al.  Approximation Algorithms for the Max-Min Allocation Problem , 2007, APPROX-RANDOM.

[21]  Jack M. Robertson,et al.  Cake-cutting algorithms - be fair if you can , 1998 .