Sciweavers

APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 6 months ago
Santa Claus Meets Hypergraph Matchings
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
Arash Asadpour, Uriel Feige, Amin Saberi
INFOCOM
2005
IEEE
13 years 10 months ago
Understanding XCP: equilibrium and fairness
— We prove that the XCP equilibrium solves a constrained max-min fairness problem by identifying it with the unique solution of a hierarchy of optimization problems, namely those...
Steven H. Low, Lachlan L. H. Andrew, Bartek P. Wyd...