Distributed learning of wardrop equilibria

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

Volumn 5204 LNCS, Issue , 2008, Pages 19-32

  Barth, Dominique ^b   Bournez, Olivier ^a   Boussaton, Octave ^a   Cohen, Johanne ^a  

^a LORIA   (France)

^b UNIVERSITY OF VERSAILLES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIAL EQUATIONS; GAME THEORY; URANIUM COMPOUNDS;

DISTRIBUTED LEARNING; DISTRIBUTED LEARNING ALGORITHMS; GAME-THEORETIC; LEARNING EQUILIBRIA; LYAPUNOV TECHNIQUES; TRAFFIC MODEL; WARDROP; WARDROP EQUILIBRIUM;

LEARNING ALGORITHMS;

EID: 52149102980     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85194-3_5     Document Type: Conference Paper

References (35)

1. Altman, E., Hayel, Y., Kameda, H.: Evolutionary Dynamics and Potential Games in Non-Cooperative Routing. In: Wireless Networks: Communication, Cooperation and Competition (WNC3 2007) (2007)
2. Berenbrink, P., Friedetzky, T., Goldberg, L.A., Goldberg, P., Hu, Z., Martin, R.: Distributed Selfish Load Balancing. In: SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 354-363. ACM, New York (2006)
3. Bournez, O.: Modèles Continus. Calculs. Algorithmique Distribuée. Hdr, Institut National Polytechnique de Lorraine (Décember 7, 2006)
4. Bournez, O., Campagnolo, M.L.: A Survey on Continuous Time Computations. In: New Computational Paradigms. Changing Conceptions of What is Computable, pp. 383-423. Springer, New York (2008)
5. Bournez, O., Campagnolo, M.L., Graça, D.S., Hainry, E.: Polynomial Differential Equations Compute All Real Computable Functions on Computable Compact Intervals. Journal of Complexity 23(3), 317-335 (2007)
6. Bournez, O., Hainry, E.: Recursive Analysis Characterized as a Class of Real Recursive Functions. Fundinform 74(4), 409-433 (2006)
7. Cole, R., Dodis, Y., Roughgarden, T.: Low much can taxes help selfish routing? In: Proceedings of the 4th ACM Conference on Electronic Commerce (EC 2003), pp. 98-107. ACM Press, New York (2003)
8. Cominetti, R., Correa, J.R., Stier-Moses, N.E.: Network Games with Atomic Players. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 525-536. Springer, Heidelberg (2006)
9. Demailly, J.-P.: Analyse Numérique et Equations Différentielles. Presses Universitaires de Grenoble (1991)
10. Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence Time to Nash Equilibria. In: 30th International Conference on Automata, Languages and Programming (ICALP), pp. 502-513 (2003)
11. Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence Time to Nash equilibrium in Load Balancing. ACM Transactions on Algorithms 3(3) (2007)
12. Even-Dar, E., Mansour, Y.: Fast Convergence of Selfish Rerouting. In: SODA 2005: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, pp. 772-781 (2005)
13. Fischer, S., Räcke, H., Vöcking, B.: Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods. In: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pp. 653-662 (2006)
14. Fischer, S., Vocking, B.: On the Evolution of Selfish Routing. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221. Springer, Heidelberg (2004)
15. Fischer, S., Vöcking, B.: Adaptive Routing with Stale Information. In: Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, pp. 276-283 (2005)
16. Fleischer, L.: Linear Tolls Suffice: New Bounds and Algorithms For Tolls in Single Source Networks. Theoretical Computer Science 348(2-3), 217-225 (2005)
17. Goldberg, P.W.: Bounds for the Convergence Rate of Randomized Local Search in a Multiplayer Load-Balancing Game. In: PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 131-140. ACM, New York (2004)
18. Harris, C.: On the Rate of Convergence of Continuous-Time Fictitious Play. Games and Economic Behavior 22(2), 238-259 (1998)
19. Hirsch, M.W., Smale, S., Devaney, R.: Differential Equations, Dynamical Systems, and an Introduction to Chaos. Elsevier Academic Press, Amsterdam (2003)
20. Hofbauer, J., Sigmund, K.: Evolutionary Game Dynamics. Bulletin of the American Mathematical Society 4, 479-519 (2003)
21. Hofbauer, J., Sorin, S.: Best Response Dynamics for Continuous Zero-Sum Games. Discrete and Continuous Dynamical Systems-Series B 6(1) (2006)
22. Koutsoupias, E., Papadimitriou, C.: Worst-case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404-413. Springer, Heidelberg (1999)
23. Thathachar, M.A.L., Narendra, K.S.: Learning Automata: An Introduction. Prentice Hall, Englewood Cliffs (1989)
24. Kushner, H.J.: Approximation and Weak Convergence Methods for Random Processes, with Applications to Stochastic Systems Theory. MIT Press, Cambridge (1984)
25. Libman, L., Orda, A.: Atomic Resource Sharing in Noncooperative Networks. Telecommunication Systems 17(4), 385-409 (2001)
26. Nash, J.F.: Equilibrium Points in n-person Games. Proc. of the National Academy of Sciences 36, 48-49 (1950)
27. Orda, A., Rom, R., Shimkin, N.: Competitive Routing in Multi-user Communication Networks. IEEE/ACM Transactions on Networking (TON) 1(5), 510-521 (1993)
28. Thathachar, M.A.L., Sastry, P.S., Phansalkar, V.V.: Decentralized Learning of Nash Equilibria in Multi-Person Stochastic Games With Incomplete Information. IEEE transactions on system, man, and cybernetics 24(5) (1994)
29. Roughgarden, T.: How unfair is optimal routing? In: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 203-204 (2002)
30. Roughgarden, T., Tardos, É.: How bad is selfish routing? Journal of the ACM 49(2), 236-259 (2002)
31. Olbrich, L., Fischer, S., Vöcking, B.: Approximating Wardrop Equilibria with Finitely Many Agents. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 238-252. Springer, Heidelberg (2007)
32. Stroock, D.W., Varadhan, S.R.S.: Multidimensional Diffusion Processes. Springer, Heidelberg (1979)
33. Vöcking, B.: Selfish Load Balancing. In: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)
34. Wardrop, J.: Some Theoretical Aspects of Road Traffic Research. Proceedings of the Institution of Civil Engineers, Part II 1(36), 352-362 (1952)
35. Weibull, J.W.: Evolutionary Game Theory. The MIT Press, Cambridge (1995)