Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Approximation algorithms
Fairness in Routing and Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fairness measures for resource allocation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On approximately fair allocations of indivisible goods
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
ACM SIGecom Exchanges
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On allocations that maximize fairness
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Graph balancing: a special case of scheduling unrelated parallel machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the importance of migration for fairness in online grid markets
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
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
Approximation Algorithms for the Max-Min Allocation Problem
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximating submodular functions everywhere
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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
Online allocation of display advertisements subject to advanced sales contracts
Proceedings of the Third International Workshop on Data Mining and Audience Intelligence for Advertising
On the importance of migration for fairness in online grid markets
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Semi-online machine covering for two uniform machines
Theoretical Computer Science
On Low-Envy Truthful Allocations
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Max-min online allocations with a reordering buffer
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
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
On-line machine covering on two machines with local migration
Computers & Mathematics with Applications
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)
On worst-case allocations in the presence of indivisible goods
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
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
Algorithmic Solutions for Envy-Free Cake Cutting
Operations Research
Algorithmic Solutions for Envy-Free Cake Cutting
Operations Research
Computing socially-efficient cake divisions
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
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.