Convergence time to Nash equilibria

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 502-513

  Even Dar, Eyal ^a   Kesselman, Alex ^a   Mansour, Yishay ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

TELECOMMUNICATION NETWORKS;

CONVERGENCE TIME; INTEGER WEIGHTS; LOAD BALANCING MODELS; NASH EQUILIBRIA; PURE NASH EQUILIBRIUM; UNRELATED MACHINES;

NETWORK MANAGEMENT;

EID: 35248833610     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_41     Document Type: Article

References (27)

1. E. Altman, T. Basar, T. Jimenez and N. Shimkin, "Routing into two parallel links: Game-Theoretic Distributed Algorithms," Journal of Parallel and Distributed Computing, pp. 1367-1381, Vol. 61, No. 9, 2001.
2. B. Awerbuh, Y. Azar, and Y. Richter, "Analysis of worse case Nash equilibria for restricted assignment," unpublished manuscript.
3. Y. Azar, "On-line Load Balancing Online Algorithms - The State of the Art," chapter 8, 178-195, Springer, 1998.
4. T. Boulogne, E. Altman and O. Pourtallier, "On the convergence to Nash equilibrium in problems of distributed computing," Annals of Operation research, 2002.
5. P. Brucker, J. Hurink, and F. Werner, "Improving Local Search Heuristics for Some Scheduling Problems, Part I," Discrete Applied Mathematics, 65, pp. 97-122, 1996.
6. P. Brucker, J. Hurink, and F. Werner, "Improving Local Search Heuristics for Some Scheduling Problems, Part II," Discrete Applied Mathematics, 72, pp. 47-69, 1997.
7. A. Czumaj, P. Krysta and B. Vocking, "Selfish traffic allocation for server farms," STOC 2002.
8. A. Czumaj and B. Vocking, "Tight bounds on worse case equilibria," SODA 2002.
9. E. Even-Dar, A. Kesselman and Y. Mansour, "Convergence Time To Nash Equilibria", Technical Report, available at http://www.cs.tau.ac.il/ẽvend/papers.html
10. G. Finn and E. Horowitz, "Linear Time Approximation Algorithm for Multiprocessor Scheduling," BIT, vol. 19, no. 3, 1979, pp. 312-320.
11. Florian, M. and D. Hearn, "Network Equilibrium Models and Algorithms", Network Routing. Handbooks in RO and MS, M.O. Ball et al. Editors, Elsevier, pp. 485-550. 1995.
12. D. Fudenberg and D. Levine, "The theory of learning in games," MIT Press, 1998.
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 ICALP, Malaga, Spain, July 2002.
14. M. Kearns and Y. Mansour, " Efficient Nash Computation in Large Population Games with Bounded Influence," In Proceedings of UAI, 2002.
15. Y. A. Korilis and A. A. Lazar, "On the Existence of Equilibria in Noncooperative Optimal Flow Control," Journal of the ACM, Vol. 42, pp. 584-613, 1995.
16. Y.A. Korilis, A.A. Lazar, and A. Orda. Architecting Noncooperative Networks. IEEE J. on Selected Areas in Communications, Vol. 13, pp. 1241-1251, 1995.
17. E. Koutsoupias, C. H. Papadimitriou, "Worst-case equilibria," STACS 99.
18. R. J. La and V. Anantharam, "Optimal Routing Control: Game Theoretic Approach," Proceedings of the 36rd IEEE Conference on Decision and Control, San Diego, CA, pp. 2910-2915, Dec. 1997.
19. M. Littman, M. Kearns, and S. Singh, "An efficient exact algorithm for singly connected graphical games," In Proceedings of NIPS, 2002.
20. I. Milchtaich, "Congestion Games with Player-Specific Payoff Functions," Games and Economic Behavior, vol. 13, pp. 111-124, 1996.
21. D. Monderer and L. S. Shapley, "Potential games," Games and Economic Behavior, 14, pp. 124-143, 1996.
22. J. F. Nash, "Non-cooperative games," Annals of Mathematics, Vol. 54, pp. 286-295, 1951.
23. A. Orda, N. Rom and N. Shimkin, "Competitive routing in multi-user communication networks," IEEE/ACM Transaction on Networking, Vol 1, pp. 614-627, 1993.
24. R. W. Rosenthal, "A class of games possessing pure-strategy Nash equilibria," International Journal of Game Theory, 2, pp. 65-67, 1973.
25. T. Roughgarden and E, Tardos, "How Bad is Selfish Routing?," In the Proceedings of the 41st Annual IEEE Symposium on the Foundations of Computer Science, 2000.
26. P. Schuurman and T. Vredeveld, "Performance guarantees of local search for multiprocessor scheduling," Proceedings IPCO, pp. 370-382, 2001.
27. S. Shenker, "Making greed work in networks a game-theoretic analysis of switch service disciplines," IEEE/ACM Transactions on Networking, Vol. 3, pp. 819-831, 1995.