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

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 114-121

  Asadpour, Arash ^a   Saberi, Amin ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Game theory; Randomized rounding

Indexed keywords

APPROXIMATION RATIO; FRACTIONAL MATCHING; RANDOMIZED ROUNDING;

APPROXIMATION ALGORITHMS; ITERATIVE METHODS; PROBLEM SOLVING; TREES (MATHEMATICS);

GAME THEORY;

EID: 35448981869     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250808     Document Type: Conference Paper

References (17)

1. N. Alon and J. H. Spencer. The probabilistic method, second edition, John Wiley & Sons, Inc. 2000.
2. S. Arora, A. Frieze and H. Kaplan. A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems, Math Programming, 2002.
3. N. Bansal and M. Sviridenko. The Santa Claus problem, Proceedings of the ACM Symposium on Theory of Computing (STOC), 2006.
4. I. Bezakova and V. Dani. Allocating indivisible goods, SIGecom Exchanges, 2005.
5. S. J. Brams and A. D. Taylor. Fair division: from Cake Cutting to Dispute Resolution, Cambridge University Press, 1996.
6. F. Chung and L. Lu. Coupling Online and Offline Analysis For Random Power Law Graphs, Internet Mathematics, 1, 2004.
7. U. Feige. A theorem related to the Santa Claus problem, manuscript, 2006.
8. L. Fleischer, M. X. Goemans, V. S. Mirrokni and M. Sviridenko. Tight approximation algorithms for maximum general assignment problems, In 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006.
9. Lisa Fleicher, N. Immorlica. Personal Communications.
10. D. Golovin. Max-min fair allocation of indivisible goods, Technical Report, Carnegie Mellon University, CMU-CS-05-144, 2005.
11. J. Kleinberg, Y. Rabani and E. Tardos. Fairness in routing and load balancing, Proceedings of Foundations of Computer Science (FOCS), 1999.
12. A. Kumar and J. Kleinberg. Fairness measures for resource allocation, Proceedings of Foundations of Computer Science (FOCS), 2000.
13. J.K. Lenstra, D.B. Shmoys and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines, Mathematical Programming, Series A, 1993.
14. R. Lipton, E. Markakis, E. Mossel and A. Saberi. On approximately fair allocations for indivisible goods, ACM Conference on Electronic Commerce (EC), 2004.
15. J. M. Robertson and W. A. Webb. Cake-Cutting Algorithms: Be fair if you can, AK Peters, 1998.
16. H. Steinhaus. The problem of fair division, Econometrica, 1948.
17. V. V. Vazirani. Approximation Algorithms, Springer-Verlag, Spring 2001.