Atomic congestion games: Fast, myopic and concurrent

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

Volumn 4997 LNCS, Issue , 2008, Pages 121-132

  Fotakis, Dimitris ^c   Kaporis, Alexis C ^a,b   Spirakis, Paul G ^a,b  

^a UNIVERSITY OF PATRAS   (Greece)

^b University of Patras and Computer Technology Institute   (Greece)

^c UNIVERSITY OF THE AEGEAN   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; DECISION THEORY; INFORMATION USE; PROBLEM SOLVING; RANDOM PROCESSES;

ATOMIC CONGESTION GAMES; SELFISH GROUPS;

GAME THEORY;

EID: 44449091010     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79309-0_12     Document Type: Conference Paper

References (31)

1. Ackermann, H., Roeglin, H., Voecking, B.: On the impact of combinatorial structure on congestion games. In: FOCS (2006)
2. Arndt, H.: Load balancing: dimension exchange on product graphs. In: 18th International Symposium on Parallel and Distributed Processing (2004)
3. Awerbuch, B., Azar, Y., Epstein, A.: The Price of Routing Unsplittable Flow. In: STOC (2005)
4. Berenbrink, P., Friedetzky, T., Goldberg, L.A., Goldberg, P., Hu, Z., Martin, R.: Distributed selfish load balancing. In: SODA (2006)
5. Blum, A., Even-Dar, E., Ligett, K.: Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games. In: PODC (2006)
6. Chien, S., Sinclair, A.: Convergece to Approximate Nash Equilibria in Congestion Games. In: SODA (2007)
7. Christodoulou, G., Koutsoupias, E.: The Price of Anarchy of Finite Congestion Games. In: STOC (2005)
8. 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)
9. Cybenko, G.: Load balancing for distributed memory multiprocessors. J. Parallel Distrib. Comput. 7, 279-301 (1989)
10. Even-Dar, E., Mansour, Y.: Fast convergence of selfish rerouting. In: SODA (2005)
11. Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence Time to Nash Equilibria. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 502-513. Springer, Heidelberg (2003)
12. Fabrikant, A., Papadimitriou, C., Talwar, K.: The Complexity of Pure Nash Equilibria. In: STOC (2004)
13. Fischer, S., Räcke, H., Vöcking, B.: Fast convergence to wardrop equilibria by adaptive sampling methods. In: STOC (2006)
14. Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish Unsplittable Flows. In: TCS, vol. 348, pp. 226-239 (2005)
15. Fotakis, D., Kontogiannis, S., Spirakis, P.: Atomic Congestion Games among Coalitions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 572-583. Springer, Heidelberg (2006)
16. Ghosh, B., Muthukrishnan, S.: Dynamic load balancing in parallel and distributed networks by random matchings. In: SPAA (1994)
17. Goemans, M.X., Mirrokni, V.S., Vetta, A.: Sink equilibria and convergence. In: FOCS 2005 (2005)
18. Goldberg, P.W.: Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game. In: PODC (2004)
19. Hayrapetyan, A., Tardos, É., Wexler, T.: The Effect of Collusion in Congestion Games. In: STOC (2006)
20. Hosseini, S.H., Litow, B., Malkawi, M.I., McPherson, J., Vairavan, K.: Analysis of a graph coloring based distributed load balancing algorithm.. J. Par. Distr. Comp. 10, 160-166 (1990)
21. Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: A simple class of congestion games. In: AAAI (2005)
22. Libman, L., Orda, A.: Atomic resource sharing in noncooperative networks. Telecommunication Systems 17(4), 385-409 (2001)
23. Mirrokni, V., 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)
24. Monderer, D., Shapley, L.: Potential Games. Games & Econ. Behavior 14, 124-143 (1996)
25. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
26. Orda, A., Rom, R., Shimkin, N.: Competitive routing in multiuser communication networks. IEEE/ACM Trans. on Net. 1(5), 510-521 (1993)
27. Rosenthal, R.W.: A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory 2, 65-67 (1973)
28. Sandholm, W.H.: Population Games and Evolutionary Dynamics. MIT Press (to be published), http://www.ssc.wisc.edu/∼whs/book/index.html
29. Sandholm, W.H.: Potential Games with Continuous Player Sets. Journal of Economic Theory 97, 81-108 (2001)
30. Extended version. http://students.ceid.upatras.gr/kaporis/papers/fks- sagt-08.pdf
31. Weibull, J.W.: Evolutionary Game Theory. MIT Press, Cambridge (1995)