Pricing for fairness: Distributed resource allocation for multiple objectives

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 197-204

  Cho, Sung Woo ^a,c   Goel, Ashish ^b  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b STANFORD UNIVERSITY   (United States)

^c University of Southern California   (United States)

Author keywords

Fairness; Pricing; Primal dual

Indexed keywords

FAIRNESS; PRICING; PRIMAL-DUAL;

ALGORITHMS; BANDWIDTH; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; FUNCTIONS; ITERATIVE METHODS;

RESOURCE ALLOCATION;

EID: 33748093918     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Y. Afek, Y. Mansour, and Z. Ostfeld. Convergence complexity of optimistic rate based flow control algorithms. Journal of Algorithms, 30(1):106-143, 1999.
2. A. Awerbuch and Y. Azar. Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 240-49, 1994.
3. B. Awerbuch and Y. Shavitt. Converging to approximated max-min flow fairness in logarithmic time. Proceedings of the 17th IEEE Infocom conference, pages 1350-57, 1998.
4. Y. Bartal, J. Byers, and D. Raz. Global optimization using local information with applications to flow control. 38th Annual Symposium on Foundations of Computer Science, pages 303-312, 1997.
5. Y. Bartal, M. Farach-Colton, M. Andrews, and L. Zhang. Fast fair and frugal bandwidth allocation in atm networks. Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 92-101, 1999.
6. R. Bhargava, A. Goel, and A. Meyerson. Using approximate majorization to characterize protocol fairness. Proceedings of ACM Sigmetrics, pages 330-331, June 2001.
7. S. Cho and A. Goel. Bandwidth allocation in networks: a single dual-update subroutine for multiple objectives. Lecture Notes in Computer Science (proceedings of the first Workshop on Combinatorial and Algorithmic Aspects of Networks (CAAN), Aug 2004), 3405:28-41.
8. B. Codenotti, A. Saberi, K. Varadarajan, and Y. Ye. Leontief economies encode nonzero sum two-player games. SODA 2006 (to appear), 2006.
9. L.K. Fleischer. Approximating fractional multicommodity flows independent of the number of commodities. SIAM J. Discrete Math., 13(4):505-520, 2000.
10. N. Garg and J. Konemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. 39th Annual Symposium on Foundations of Computer Science, pages 300-309, 1998.
11. N. Garg and N. Young. On-line, end-toend congestion control. IEEE Foundations of Computer Science, pages 303-312, 2002.
12. A. Goel and A. Meyerson. Simultaneous optimization via approximate majorization for concave profits or convex costs. Algorithmica, 44(4):301-323, May 2006.
13. A. Goel, A. Meyerson, and S. Plotkin. Combining fairness with throughput: Online routing with multiple objectives. Journal of Computer and Systems Sciences, 63(1):62-79, 2001.
14. A. Goel, A. Meyerson, and S. Plotkin. Approximate majorization and fair online load balancing. ACM Transactions on Algorithms, 1(2):338-349, October 2005.
15. G.H. Hardy, J.E. Littlewood, and G. Polya. Some simple inequalities satisfied by convex functions. Messenger Math., 58:145-152, 1929.
16. G.H. Hardy, J.E. Littlewood, and G. Polya. Inequalities. 1st ed., 2nd ed. Cambridge University Press, London and New York., 1934, 1952.
17. F.P. Kelly, A.K. Maulloo, and D.K.H. Tan. Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49:237-252, 1998.
18. J. Kleinberg, Y. Rabani, and E. Tardos. Fairness in routing and load balancing. J. Comput. Syst. Sci., 63(1):2-20, 2001.
19. A. Kumar and J. Kleinberg. Fairness measures for resource allocation. Proceedings of 41st IEEE Symposium on Foundations of Computer Science, 2000.
20. S. Low, L. Peterson, and L. Wang. Understanding TCP Vegas: a duality model. Proceedings of ACM Sigmetrics, 2001.
21. M. Luby and N. Nisan. A parallel approximation algorithm for positive linear programming. Proceedings of 25th Annual Symposium on the Theory of Computing, pages 448-57, 1993.
22. A.W. Marshall and I. Olkin. Inequalities: theory of majorization and its applications. Academic Press (Volume 143 of Mathematics in Science and Engineering), 1979.
23. S. Plotkin, D. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Math of Oper. Research, pages 257-301, 1994.
24. A. Tamir. Least majorized elements and generalized polymatroids. Mathematics of Operations Research, 20(3):583-589, 1995.