Convergence time to Nash equilibrium in load balancing

ACM Transactions on Algorithms

Volumn 3, Issue 3, 2007, Pages

  Even Dar, Eyal ^a,d   Kesselman, Alex ^b   Mansour, Yishay ^c  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c TEL AVIV UNIVERSITY   (Israel)

^d UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Convergence time; Game theory; Nash equilibrium

Indexed keywords

AUTOMATA THEORY; CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING;

CONVERGENCE TIME; NASH EQUILIBRIUM; UNRELATED MACHINES;

GAME THEORY;

EID: 34548247126     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1273340.1273348     Document Type: Article

References (29)

1. ALTMAN, E., BASAR, T., JIMENEZ, T., AND SHIMKIN, N. 2001. Routing into two parallel links: Game-Theoretic distributed algorithms. J. Parallel Distrib. Comput. 61, 9, 1367-1381.
2. AWERBUCH, B., AZAR, Y., AND EPSTEIN, A. 2005. The price of routing unsplittable flow. In Proceedings of the 37th Symposium on Theory of Computing. 57-66.
3. AZAR, Y. 1998. On-Line load balancing. Online Algorithms In: The State of the Art. Springer, Chap. 8, 178-195.
4. BOULOGNE, T., ALTMAN, E., AND POURTALLIER, O. 2002. On the convergence to nash equilibrium in problems of distributed computing. Ann. Oper. Res. 109, 1-4, 279-291.
5. BRUCKER, P., HURINK, J., AND WERNER, F. 1997. Improving local search heuristics for some scheduling problems: Part II. Discrete Appl. Math. 72, 47-69.
6. BRUCKER, P., HURINK, J., AND WERNER, F. 1996. Improving local search heuristics for some scheduling problems. Part I. Discrete Appl. Math. 65, 97-122.
7. CZUMAJ, A., KRYSTA, P., AND VOCKING, B. 2002. Selfish traffic allocation for server farms. In Proceedings of the 34th Symposium on Theory of Computing. 287-296.
8. CZUMAJ, A., AND VOCKING, B. 2002. Tight bounds on worse case equilibria. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 413-420.
9. EVEN-DAR, E., AND MANSOUR, Y. 2005. Fast convergence of selfish rerouting. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algoritlims (SODA). 772-781.
10. FELDMANN, R., GAIRING, M., LCKING, T., AND B. MONIEN, M. R. 2003. Nashification and the coordination ratio for a selfish routing game. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP). 514-526.
11. FINN, G., AND HOROWITZ, E. 1979. A lineartime approximation algorithm, for multiprocessor scheduling. BIT Numer. Math. 19, 3, 312-320.
12. FOTAKIS, D., KONTOGIANNIS, S., AND SPIRAKIS, P. 2004. Selfish unsplittable flows. In Proceedings of the 31th International Colloquium on Automata, Languages and Programming (ICALP). 593-605.
13. FOTAKIS, D., KONTOGIANNIS, S., KOUTSOUPIAS, E., MAVRONICOLAS, M., AND SPIRAKIS, P. 2002. The structure and complexity of Nash equilibria for a selfish routing game. In Proceedings of the 29th International Colloquium on Automatia, Languages and Programming (ICALP). 123-134.
14. FUDENBERG, D., AND LEVINE, D. 1998. The Theory of Learning in Games. MIT Press, Cambridge, MA.
15. GOLDBERG, P. 2004. Bounds for the convergence rate of randomized local search in multiplayer games, uniform resource sharing game. In Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC). 131-140.
16. HOPCROFT, J., AND ULLMAN, J. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.
17. KEARNS, M., AND MANSOUR, Y. 2002. Efficient, nash computation in large population games with bounded influence. In Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence (UAI).
18. KOUTSOUPIAS, E., AND PAPADMITRIOU, C. H. 1999. Worst-Case equilibria. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS). 404-413.
19. LITTMAN, M., KEARNS, M., AND SINGH, S. 2002. An efficient exact algorithm for singly connected graphical games. In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS).
20. MAVRONICOLAS, M., AND SPIRAKIS, P. 2001. The price of selfish routing. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC). 510-519.
21. MILCHTAICH, I. 1996. Congestion games with player-specific payoff functions. Games Econom. Behav. 13, 111-124.
22. MIRROKNI, V., AND VETTA, A. 2004. Convergence issues in competitive games. In Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization.
23. MONDERER, D., AND SHAPLEY, L. S. 1996. Potential games. Games Econom. Behav. 14, 124-143.
24. NASH, J. F. 1951. Non-Cooperative games. Ann. Math. 54, 286-295.
25. ORDA, A., ROM, N., AND SHIMKIN, N. 1993. Competitive routing in multi-user communication networks. IEEE/ACM Trans. Netw. 1, 614-627.
26. PAPADIMITRIOU, C. H. 2001. Algorithms, games, and the Internet. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC). 749-753.
27. ROSENTHAL, R. W. 1973. A class of games possessing pure-strategy nash equilibria. Int. J. Game Theory 2, 65-67.
28. ROUGHGARDEN, T., AND TARDOS, E. 2002. How bad is selfish routing? J. ACM 49, 2, 236-259.
29. SCHUURMAN, P., AND VREDEVELD, T. 2001. Performance guarantees of local search for multiprocessor scheduling. In Proceedings of the Conference on Integer Programming and Combinatorial Optimization (IPCO). 370-382.