Selfish load balancing

Algorithmic Game Theory

Volumn 9780521872829, Issue , 2007, Pages 517-542

  VÖcking, Berthold ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; COMPUTER GAMES; OPTIMIZATION;

COMPUTING EQUILIBRIA; DIFFERENT SPEED; GAME-THEORETIC; NASH EQUILIBRIA; NETWORKS AND DISTRIBUTED SYSTEMS; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; PRICE OF ANARCHY;

BALANCING;

EID: 84926079189     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511800481.022     Document Type: Chapter

References (34)

1. N. Andelman, M. Feldman, and Y. Mansour. Strong price of anarchy. In Proc. 18th Annual ACM-SIAM Symp. on Discrete Algorithms, 2007.
2. B. Awerbuch, Y. Azar, Y. Richter, and D. Tsur. Tradeoffs in worst-case equilibria. In Proc. 1st International Workshop on Approximation and Online Algorithms (WAOA), pp. 41–52, 2003.
3. R. Beier, A. Czumaj, P. Krysta, and B.Vöcking. Computing equilibria for congestion games with (im)perfect information. In Proc. 15th Annual ACM-SIAM Symp. Discrete Algorithms, pp. 746–755, 2004.
4. P. Berenbrink, T. Friedetzky, L.A. Goldberg, P.W. Goldberg, Z. Hu, and R.A. Martin. Distributed selfish load balancing. In Proc. 17th Annual ACM-SIAM Symp. Discrete Algorithms, pp. 354–363, 2006.
5. I. Caragiannis, M. Flammini, C. Kaklamanis, P. Kanellopoulos, and L. Moscardelli. Tight bounds for selfish and greedy load balancing. In Proc. 33rd Intl. Colloq. on Automata, Languages, and Programming, pp. 311–322, 2006.
6. G. Christodoulou, E. Koutsoupias, and A. Nanavati. Coordination Mechanisms. In Proc. 31st Intl. Colloq. on Automata, Languages and Programming, pp. 345–357, 2004.
7. A. Czumaj. Selfish Routing on the Internet. Chapter 42 in Handbook of Scheduling: Algorithms, Models, and Performance Analysis, edited by J. Leung, CRC Press, Boca Raton, FL, 2004.
8. A. Czumaj, P. Krysta, and B. Vöcking. Selfish traffic allocation for server farms. In Proc. 34th Annual ACM Symp. Theory of Computing, pp. 287–296, 2002.
9. A. Czumaj and B. Vöcking. Tight bounds for worst-case equilibria. In Proc. 13th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 413–420, 2002.
10. E. Even-Dar, A. Kesselman, and Y. Mansour. Convergence time to Nash equilibria. In Proc. 30th International Colloq. on Automata, Languages and Programming, pp. 502–513, 2003.
11. E. Even-Dar and Y. Mansour. Fast convergence of selfish rerouting. In Proc. 16th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 772–781, 2005.
12. R. Feldmann, M. Gairing, T. Lücking, B. Monien, and M. Rode. Nashification and the coordination ratio for a selfish routing game. In Proc. 30th International Colloq. on Automata, Languages and Programming, pp. 414–426, 2003a.
13. R. Feldmann, M. Gairing, T. Lücking, B. Monien, and M. Rode. Selfish routing in non-cooperative networks: a survey. In Proc. 28th International Symp. on Mathematical Foundations of Computer Science, pp. 21–45, 2003b.
14. G. Finn and E. Horowitz. A linear time approximation algorithm for multiprocessor scheduling. BIT, 19(3):312–320, 1979.
15. S. Fischer and B. Vöcking. On the structure and complexity of worst-case equilibria. In Proc. 1st Workshop on Internet and Network Economics, pp. 151–160, 2005.
16. D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, and P. Spirakis. The structure and complexity of Nash equilibria for a selfish routing game. In Proc. 29th Intl. Colloquium on Automata, Languages and Programming (ICALP), pp. 123–134, 2002.
17. D.K. Friesen. Tighter bounds for LPT scheduling on uniform processors. SIAM J. Computing, 16(3):554–560, 1987.
18. M. Gairing, T. Lücking, M. Mavronicolas, and B. Monien. Computing Nash equilibria for scheduling on restricted parallel links. In Proc. 36th Annual ACMSymp. on Theory of Computing, pp. 613–622, 2004a.
19. M. Gairing, T. Lücking, M. Mavronicolas, and B. Monien. The price of anarchy for polynomial social cost. In Proc. 29th Intl. Symp. on Mathematical Foundations of Computer Science, pp. 574–585, 2004b.
20. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien, and M. Rode. Nash equilibria in discrete routing games with convex latency functions. In Proc. 31st Intl. Colloq. on Automata, Languages and Programming, pp. 645–657, 2004c.
21. M. Gairing, T. Lücking, M. Mavronicolas, and B. Monien. The Price of Anarchy for Restricted Parallel Links. Parallel Process. Lett., 16(1):117–132, 2006.
22. M. Gairing, B. Monien, and K. Tiemann. Selfish routing with incomplete information. In Proc. 17th Annual ACM Symp. on Parallel Algorithms, pp. 203–212, 2005.
23. R.L. Graham. Bounds for certain multiprocessing anomalies. Bell System Tech. J., 45: 1563–1581, 1966.
24. R.L. Graham. Bounds on multiprocessing timing anomalies. SIAM J. Appl.Math., 17: 263–269, 1969.
25. D.S. Hochbaum and D.B. Shmoys. A polynomial approximation scheme for scheduling on uniform processors. SIAM J. Computing, 17(3):539–551, 1988.
26. N. Immorlica, L. Li, V.S. Mirrokni, and A. Schulz. Coordination mechanisms for selfish scheduling. In Proc. 1st Workshop on Internet and Network Economics, pp. 55–69, 2005.
27. E. Koutsoupias. Selfish task allocation. Bulletin of the EATCS (81), pp. 79–88, 2003.
28. E. Koutsoupias, M. Mavronicolas, and P. Spirakis. Approximate equilibria and ball fusion. Theory of Computing Systems, 36(6):683–693, 2003.
29. E. Koutsoupias and C.H. Papadimitriou. Worst-case equilibria. In Proc. 16th Annual Symp. on Theoretical Aspects of Computer Science, pp. 404–413, 1999.
30. L. Libman and A. Orda. The designer’s perspective to atomic noncooperative networks. IEEE/ACM Trans. Networking, 7(6):875–884, 1999.
31. L. Libman and A. Orda. Atomic resource sharing in noncooperative networks. Telecommun. Systems, 17(4):385–409, 2001.
32. M. Mavronicolas and P. Spirakis. The price of selfish routing. In Proc. 33rd ACM Symp. on Theory of Computing, pp. 510–519, 2001.
33. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
34. S. Suri, C. Toth, and Y. Zhou. Selfish load balancing and atomic congestion games. In Proc. 16th Annual ACM Symp. on Parallel Algorithms and Architectures, pp. 188–195, 2005.