On allocating goods to maximize fairness

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 107-116

  Chakrabarty, Deeparnab ^a   Chuzhoy, Julia ^b   Khanna, Sanjeev ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALLOCATION PROBLEMS; APPROXIMABILITY; BUILDING BLOCKES; HARDNESS OF APPROXIMATION; INTEGRALITY GAPS; LINEAR PROGRAMS; LOGARITHMIC APPROXIMATION; MAX-MIN; POLYNOMIAL-TIME; QUASI-POLYNOMIAL TIME; TECHNICAL ASPECTS;

APPROXIMATION ALGORITHMS; COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS;

POLYNOMIAL APPROXIMATION;

EID: 77952369679     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.51     Document Type: Conference Paper

References (18)

1. A. Asadpour, U. Feige, and A. Saberi. Santa Claus meets hypergraph matchings. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 10-20, 2008.
2. A. Asadpour and A. Saberi. An approximation algorithm for max-min fair allocation of indivisible goods. Proceedings of ACM Symposium on the Theory of Computation (STOC), pages 114-121, 2007.
3. N. Bansal and M. Sviridenko. The Santa Claus Problem. Proceedings of ACM Symposium on the Theory of Computation (STOC), pages 31-40, 2006.
4. M. H. Bateni, M. Charikar, and V. Guruswami. MaxMin Allocation via Degree Lower-Bounded Arborescences. Proceedings of ACM Symposium on the Theory of Computation (STOC), pages 543-552, 2009.
5. M. H. Bateni, M. Charikar, and V. Guruswami. New approximation algorithms for degree lower-bounded arborescences and max-min allocation. Technical Report TR-848-09, Computer Science Department, Princeton University, March 2009.
6. I. Bezakova and V. Dani. Allocating indivisible goods. SIGecom Exchanges, 5(3):11-18, 2005.
7. S. J. Brams and A. D. Taylor. Fair Division: From Cake-Cutting to Dispute Resolution. Cambridge University Press, 1996.
8. D. Chakrabarty, J. Chuzhoy and S. Khanna. On Allocating Goods to Maximize Fairness. Full version available at the authors' webpages.
9. R. D. Carr, L. K. Fleischer, V. J. Leung, and C. A. Phillips. Strengthening integrality gaps for capacitated network design and covering problems ACM-SIAM Annual Symposium on Discrete Algorithms (SODA), pages 106-115, 2000.
10. T. Ebenlendr, M. Krcal, and J. Sgall. Graph balancing: a special case of scheduling unrelated parallel machines. ACM-SIAM Annual Symposium on Discrete Algorithms (SODA), pages 483-490, 2008.
11. L. Epstein and J. Sgall. Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica, 39(1):43-57, 2004. (Pubitemid 40871672)
12. U. Feige. On allocations that maximize fairness. ACM-SIAM Annual Symposium on Discrete Algorithms (SODA), pages 287-293, 2008.
13. M. X. Goemans, N. J. A. Harvey, S. Iwata, and V. Mirokkni. Approximating submodular functions everywhere. ACM-SIAM Annual Symposium on Discrete Algorithms (SODA), To appear, 2009.
14. S. Khot and A. K. Ponnuswami. Approximation Algorithms for the Max-Min Allocation Problem. APPROX-RANDOM, pp. 204-217, 2007.
15. J. K. Lenstra, D. B. Shmoys, and É. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Math. Programming, 46:259-271, 1990.
16. C.H. Papadimitriou and M. Yannakakis. Shortest paths without a map. Theo. Comp. Sci. 84:127-150, 1991
17. G. J. Woeginger. A polynomial time approximation scheme for maximizing the minimum machine completion time. Operations Research Letters, 20:149-154, 1997.
18. G. J. Woeginger. When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS Journal on Computing, 12:57-75, 2000.