ACM SIGecom Exchanges
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An approximation algorithm for max-min fair allocation of indivisible goods
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A polynomial-time approximation scheme for maximizing the minimum machine completion time
Operations Research Letters
Santa Claus Meets Hypergraph Matchings
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
MaxMin allocation via degree lower-bounded arborescences
Proceedings of the forty-first annual ACM symposium on Theory of computing
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Semi-online machine covering for two uniform machines
Theoretical Computer Science
Deterministic algorithms for the Lovász Local Lemma
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A truthful constant approximation for maximizing the minimum load on related machines
WINE'10 Proceedings of the 6th international conference on Internet and network economics
An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
SIAM Journal on Computing
Santa Claus schedules jobs on unrelated machines
Proceedings of the forty-third annual ACM symposium on Theory of computing
On the configuration-LP for scheduling on unrelated machines
ESA'11 Proceedings of the 19th European conference on Algorithms
New Constructive Aspects of the Lovász Local Lemma
Journal of the ACM (JACM)
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
The entropy rounding method in approximation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Santa claus meets hypergraph matchings
ACM Transactions on Algorithms (TALG)
Quasi-polynomial local search for restricted max-min fair allocation
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m players. Every player is interested only in some of the items and has zero value for the other items. One has to distribute the items among the players in a way that maximizes a certain notion of fairness, namely, maximizes the minimum of the sum of values of items given to any player. Bansal and Sviridenko [STOC 2006] describe a linear programming relaxation for this problem, and present a rounding technique that recovers an allocation of value at least Ω(log log log m/log log m) of the optimum. We show that the value of this LP relaxation in fact approximates the optimum value to within a constant factor. Our proof is not constructive and does not by itself provide an efficient algorithm for finding an allocation that is within constant factors of optimal.