Concurrent imitation dynamics in congestion games

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2009, Pages 63-72

  Ackermann, Heiner ^a   Berenbrink, Petra ^b   Fischer, Simon ^a   Hoefer, Martin ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Adaptive routing; Dynamics; Game theory; Imitation

Indexed keywords

ADAPTIVE ROUTING; CONGESTION GAMES; CONVERGENCE PROPERTIES; CONVERGENCE TIME; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; IMITATION; IMITATION DYNAMICS; IMITATION PROCESS; LATENCY FUNCTION; NETWORK STRUCTURES; NON-ZERO PROBABILITY; OPTIMAL STATE; POTENTIAL FUNCTION; RAPID CONVERGENCE; SOCIAL COST; STABLE STATE; SYMMETRIC NETWORK;

COMPUTER SCIENCE; DISTRIBUTED COMPUTER SYSTEMS; DYNAMICS; POLYNOMIAL APPROXIMATION;

GAME THEORY;

EID: 70350686466     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1582716.1582732     Document Type: Conference Paper

References (27)

1. H. Ackermann, S. Fischer, M. Hoefer, and M. Schöngens. Distributed Algorithms for QoS Load Balancing. In Proc. 21st Symposium Parallelism in Algorithms and Architectures (SPAA), 2009.
2. H. Ackermann, H. Röglin, and B. Vöcking. On the impact of combinatorial structure on congestion games. J ACM, 55(6), 2008.
3. B. Awerbuch, Y. Azar, and A. Epstein. The price of routing unsplittable flow. In Proc. 37th Symposium on Theory of Computing (STOC), pages 57-66, 2005.
4. B. Awerbuch, Y. Azar, A. Epstein, V. Mirrokni, and A. Skopalik. Fast convergence to nearly optimal solutions in potential games. In Proc. 9th Conference on Electronic Commerce, pages 264-273, 2008.
5. P. Berenbrink, T. Friedetzky, L. Goldberg, P. Goldberg, Z. Hu, and R. Martin. Distributed selfish load balancing. SIAM J. Comput., 37(4):1163-1181, 2007.
6. P. Berenbrink, T. Friedetzky, I. Hajirasouliha, and Z. Hu. Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks. In Proc. 15th European Symposium on Algorithms (ESA), pages 41-52, 2007.
7. A. Blum, E. Even-Dar, and K. Ligett. Routing without regret: On convergence to Nash equilibria of regret-minimizing algorithms in routing games. In Proc. 25th Symposium on Principles of Distributed Computing (PODC), pages 45-52, 2006.
8. S. Chien and A. Sinclair. Convergence to approximate Nash equilibria in congestion games. In Proc. 18th Symposium on Discrete Algorithms (SODA), pages 169-178, 2007.
9. G. Christodoulou and E. Koutsoupias. The price of anarchy of finite congestion games. In Proc. 37th Symposium on Theory of Computing (STOC), pages 67-73, 2005.
10. E. Even-Dar, A. Kesselman, and Y. Mansour. Convergence time to Nash equilibrium in load balacing. ACM Transact. Algorithms, 3(3), 2007.
11. E. Even-Dar and Y. Mansour. Fast convergence of selfish rerouting. In Proc. 16th Symposium on Discrete Algorithms (SODA), pages 772-781, 2005.
12. A. Fabrikant, C. Papadimitriou, and K. Talwar. The complexity of pure Nash equilibria. In Proc. 36th Symposium on Theory of Computing (STOC), pages 604-612, 2004.
13. A. Fanelli, M. Flammini, and L. Moscardelli. The speed of convergence in congestion games under best-response dynamics. In Proc. 35th International Colloquium on Automata, Languages and Programming (ICALP), pages 796-807, 2008.
14. S. Fischer, L. Olbrich, and B. Vöcking. Approximating Wardrop equilibria with finitely many agents. Distributed Computing, 21(2):129-139, 2008.
15. S. Fischer, H. Räcke, and B. Vöcking. Fast convergence to Wardrop equilibria by adaptive sampling methods. In Proc. 38th Symposium on Theory of Computing (STOC), pages 653-662, 2006.
16. S. Fischer and B. Vöcking. Adaptive routing with stale information. Theoretical Computer Science, 2008. Invited paper. To appear.
17. D. Fotakis, A. Kaporis, and P. Spirakis. Atomic congestion games: Fast, myopic and concurrent. In Proc. 1st Symposium on Algorithmic Game Theory (SAGT), pages 121-132, 2008.
18. P. Goldberg. Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game. In Proc. 23rd Symposium on Principles of Distributed Computing (PODC), pages 131-140, 2004.
19. T. Hagerup and C. Rüb. A guided tour of Chernoff bounds. Inf. Process. Lett., 33:305-308, 1990.
20. J. Hofbauer and K. Sigmund. Evolutionary Games and Population Dynamics. Cambridge University Press, 1998.
21. S. Ieong, R. McGrew, E. Nudelman, Y. Shoham, and Q. Sun. Fast and compact: A simple class of congestion games. In Proceedings of the 20th Conference on Artificial Intelligence (AAAI), pages 489-494, 2005.
22. E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In Proc. 16th Symposium on Theoretical Aspects of Computer Science (STACS), pages 404-413. Springer-Verlag, 1999.
23. N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, editors. Algorithmic Game Theory. Cambridge University Press, 2007.
24. R. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2:65-67, 1973.
25. T. Roughgarden and É. Tardos. How bad is selfish routing? J ACM, 49(2):236-259, 2002.
26. A. Skopalik and B. Vöcking. Inapproximability of pure Nash equilibria. In Proc. 40th Symposium on Theory of Computing (STOC), pages 355-364, 2008.
27. J. Weibull. Evolutionary Game Theory. MIT press, 1995.