Distributed selfish load balancing

SIAM Journal on Computing

Volumn 37, Issue 4, 2007, Pages 1163-1181

  Berenbrink, Petra ^a   Friedetzky, Tom ^b   Ann Goldberg, Leslie ^c   Goldberg, Paul W ^c   Hu, Zengjian ^a   Martin, Russell ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b DURHAM UNIVERSITY   (United Kingdom)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Convergence; Equilibrium; Load balancing; Reallocation

Indexed keywords

BALANCED ALLOCATION; CENTRAL CONTROL; CENTRALIZED CONTROL; CONVERGENCE; CONVERGENCE PROPERTIES; EQUILIBRIUM; LOAD BALANCING; NASH EQUILIBRIUM; REALLOCATION;

AGENTS;

EID: 49449097263     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060660345     Document Type: Article

References (29)

1. H. ACKERMANN, H. RÖGLIN, AND B. VÖCKING, On the impact of combinatorial structure on congestion games, in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2006, pp. 613-622.
2. A. BLUM, E. EVEN-DAR, AND K. LIGETT, Routing without regret: On convergence to Nash equilibria of regret-minimizing algorithms in routing games, in Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing, 2006, pp. 45-52.
3. S. CHIEN AND A. SINCLAIR, Convergence to approximate Nash equilibria in congestion games, in Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, LA, 2007, pp. 169-178.
4. A. CZUMAJ, P. KRYSTA, AND B. VÖCKING, Selfish traffic allocation for server farms, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), Montreal, 2002, pp. 287-296.
5. A. CZUMAJ, C. RILEY, AND C. SCHEIDELER, Perfectly balanced allocation, in Proceedings of the 7th Annual International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-APPROX), Princeton, NJ, Lecture Notes in Comput. Sci. 2764, Springer-Verlag, Berlin, 2003, pp. 240-251.
6. A. CZUMAJ AND B. VÖCKING, Tight bounds for worst-case equilibria, in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 2002, pp. 413-420.
7. E. EVEN-DAR, A. KESSELMAN, AND Y. MANSOUR, Convergence time to Nash equilibria, in Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP), Eindhoven, The Netherlands, 2003, pp. 502-513.
8. E. EVEN-DAR AND Y. MANSOUR, Fast convergence of selfish rerouting, in Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, BC, 2005, pp. 772-781.
9. A. FABRIKANT, C. H. PAPADIMITRIOU, AND K. TALWAR, The complexity of pure Nash equilibria, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), 2004, pp. 604-612.
10. R. FELDMAN, M. GAIRING, T. LUCKING, B. MONIEN, AND M. RODE, Nashification and the coordination ratio for a selfish routing game, in Proceedings of the 30th Annual International Colloquium on Automata, Languages and Programming (ICALP 30), Lecture Notes in Comput. Sci. 2719, Springer-Verlag, Berlin, 2003, pp. 514-526.
11. S. FISCHER, H. RÄCKE, AND B. VÖ CKING, Fast convergence to Wardrop equilibria by adaptive sampling methods, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), Seattle, WA, 2006, pp. 53-662.
12. S. FISCHER AND B. VÖCKING, Adaptive routing with stale information, in Proceedings of the 24th Annual ACM SIGACT/SIGOPS Symposium on Principles of Distributed Computing (PODC), 2005, pp. 276-283.
13. D. FOTAKIS, S. KONTOGIANNIS, E. KOUTSOUPIAS, M. MAVRONICOLAS, AND P. SPIRAKIS, The structure and complexity of Nash equilibria for a selfish routing game, in Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP), Malaga, Spain, 2002, pp. 123-134.
14. P. GOLDBERG, Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game, in Proceedings of the 23rd Annual ACM SIGACT/SIGOPS Symposium on Principles of Distributed Computing (PODC), St. John's, Newfoundland, 2004, pp. 131-140.
15. T. HAGERUP AND C. RUB, A guided tour of Chernoff bounds, Inform. Process. Lett., 33 (1989), pp. 305-308.
16. S. IEONG, R. MCGREW, E. NUDELMAN, Y. SHOHAM, AND Q. SUN, Fast and compact: A simple class of congestion games, in Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI), 2005, pp. 489-494.
17. D. S. JOHNSON. C. H. PAPADIMITRIOU. AND M. YANNAKAKIS, How easy is local search?, J. Comput. System Sci., 37 (1988), pp. 79-100.
18. E. KOUTSOUPIAS AND C. H. PAPADIMITRIOU, Worst-case equilibria, in Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Trier, Germany, 1999, pp. 404-413.
19. M. LUBY, D. RANDALL, AND A. SINCLAIR, Markov chain algorithms for planar lattice structures, SIAM J. Comput., 31 (2001), pp. 167-192.
20. M. MAVRONICOLAS AND P. SPIRAKIS, The price of selfish routing, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), Crete, Greece, 2001, pp. 510-519.
21. I. MILCHTAICH, Congestion games with play er-specific payoff functions, Games Econom. Behav., 13 (1996), pp. 111-124.
22. V. S. MIRROKNI AND A. VETTA, Convergence issues in competitive games, in APPROX-RANDOM, Lecture Notes in Comput. Sci. 3122, Springer-Verlag, Berlin, 2004, pp. 183-194.
23. M. MITZENMACHER, A. RICHA, AND R. SITARAMAN, The power of two random choices: A survey of techniques and results, in Handbook of Randomized Computing, P. Pardalos, S. Rajasekaran, and J. Rolim, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000, pp. 255-312.
24. D. MONDERER AND L. S. SHAPLEY, Potential games, Games Econom. Behav., 14 (1996), pp. 124-143.
25. A. ORDA, R. ROM, AND N. SHIMKIN, Competitive routing in multi-user communication networks, IEEE/ACM Trans. Networking, 1 (1993), pp. 510-521.
26. R. W. ROSENTHAL, A class of games possessing pure-strategy Nash equilibria, Internat. J. Game Theory, 2 (1973), pp. 65-67.
27. T. ROUGHGARDEN, Selfish Routing and the Price of Anarchy, MIT Press, Cambridge, MA, 2005.
28. T. ROUGHGARDEN AND É. TARDOS, How bad is selfish routing?, J. ACM, 49 (2002), pp. 236-259.
29. P. SANDERS, S. EGNER, AND J. KORST, Fast concurrent access to parallel disks, in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, 2000, pp. 849-858.