The speed of convergence in congestion games under best-response dynamics

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

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 796-807

  Fanelli, Angelo ^a   Flammini, Michele ^a   Moscardelli, Luca ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY; LINGUISTICS; SPEED; TRANSLATION (LANGUAGES);

BEST RESPONSE; CONGESTION GAMES; PRICE OF ANARCHY; SPEED OF CONVERGENCE;

DYNAMICS;

EID: 49049094863     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_65     Document Type: Conference Paper

References (19)

1. Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. In: FOCS, pp. 613-622. IEEE Computer Society, Los Alamitos (2006)
2. Awerbuch, B., Azar, Y., Epstein, A.: Large the price of routing unsplittable flow. In: STOC, pp. 57-66. ACM, New York (2005)
3. Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V.S., Shopalik, A.: Fast convergence to nearly optimal solutions in potential games. In: EC 2008 (to appear, 2008)
4. Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 311-322. Springer, Heidelberg (2006)
5. Chien, S., Sinclair, A.: Convergence to approximate nash equilibria in congestion games. In: SODA, pp. 169-178. SIAM, Philadelphia (2007)
6. Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: STOC, pp. 67-73. ACM, New York (2005)
7. Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 349-360. Springer, Heidelberg (2006)
8. Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. Personal Communication (2007)
9. Yannakakis, M., Johnson, D.S., Papadimitriou, C.H.: How easy is local search? Journal of Computer and System Sciences 37, 79-100 (1988)
10. Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure equilibria. In: Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), pp. 604-612. ACM, New York (2004)
11. Fanelli, A., Flammini, M., Melideo, G., Moscardelli, L.: Multicast transmissions in non-cooperative networks with a limited number of selfish moves. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 363-374. Springer, Heidelberg (2006)
12. Fanelli, A., Flammini, M., Moscardelli, L.: On the convergence of multicast games in directed networks. In: SPAA, pp. 330-338. ACM, New York (2007)
13. Goemans, M.X., Mirrokni, V.S., Vetta, A.: Sink equilibria and convergence. In: FOCS, pp. 142-154. IEEE Computer Society, Los Alamitos (2005)
14. Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404-413. Springer, Heidelberg (1999)
15. Milchtaich, I.: Congestion games with player-specific payoff functions. Games and Economic Behavior 13, 111-124 (1996)
16. Mirrokni, V.S., Vetta, A.: Convergence issues in competitive games. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 183-194. Springer, Heidelberg (2004)
17. Nash, J.F.: Equilibrium points in n-person games. Proceedings of the National Academy of Sciences 36, 48-49 (1950)
18. Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory 2, 65-67 (1973)
19. Skopalik, A., Vöcking, B.: Inapproximability of convergence in congestion games (manuscript, 2007)