E. Altman, Y. Hayel, and H. Kameda, Evolutionary dynamics and potential games in non-cooperative routing, 2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops, 2007.
DOI : 10.1109/WIOPT.2007.4480096

URL : https://hal.archives-ouvertes.fr/hal-01314342

P. Berenbrink, T. Friedetzky, L. A. Goldberg, P. Goldberg, Z. Hu et al., Distributed selfish load balancing, SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp.354-363, 2006.

P. Berenbrink and O. Schulte, Evolutionary equilibrium in bayesian routing games: Specialization and niche formation, ESA, pp.29-40, 2007.

I. Caragiannis, M. Flammini, C. Kaklamanis, P. Kanellopoulos, and L. Moscardelli, Tight bounds for selfish and greedy load balancing, Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming (ICALP'06), pp.311-322

P. Coucheney, C. Touati, and B. Gaujal, Fair and Efficient User-Network Association Algorithm for Multi-Technology Wireless Networks, IEEE INFOCOM 2009, The 28th Conference on Computer Communications, 2009.
DOI : 10.1109/INFCOM.2009.5062237

URL : https://hal.archives-ouvertes.fr/inria-00322403

P. Coucheney, C. Touati, and B. Gaujal, Selection of efficient pure strategies in allocation games, 2009 International Conference on Game Theory for Networks, 2009.
DOI : 10.1109/GAMENETS.2009.5137457

URL : https://hal.archives-ouvertes.fr/hal-00788918

A. Czumaj, P. Krysta, and B. Vöcking, Selfish traffic allocation for server farms, ACM Symposium on Theory of Computing (STOC), 2002.

A. Czumaj, Handbook of Scheduling: Algorithms, Models, and Performance Analysis, chapter Selfish Routing on the Internet, 2004.

E. Even-dar, A. Kesselman, and Y. Mansour, Convergence Time to Nash Equilibria, 30th International Conference on Automata, Languages and Programming (ICALP), pp.502-513, 2003.
DOI : 10.1007/3-540-45061-0_41

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.5811

E. Even-dar, A. Kesselman, and Y. Mansour, Convergence time to Nash equilibrium in load balancing, ACM Transactions on Algorithms, vol.3, issue.3, 2007.
DOI : 10.1145/1273340.1273348

E. Even-dar and Y. Mansour, Fast convergence of selfish rerouting, SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pp.772-781, 2005.

. Feldmann, . Gairing, . Lucking, and R. Monien, Selfish routing in non-cooperative networks: A survey, MFCS: Symposium on Mathematical Foundations of Computer Science, 2003.

S. Fischer, H. Räcke, and B. Vöcking, Fast convergence to Wardrop equilibria by adaptive sampling methods, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pp.653-662, 2006.

S. Fischer, B. Vocking, E. K. Spyros-kontogiannis, M. Mavronicolas, and P. Spirakis, On the Evolution of Selfish Routing, 12th Annual European Symposium Proceedings The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. Automata, Languages and Programming: 29th International Colloquium, 2002.
DOI : 10.1007/978-3-540-30140-0_30

W. Paul and . Goldberg, Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game, PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp.131-140, 2004.

C. Harris, On the Rate of Convergence of Continuous-Time Fictitious Play, Games and Economic Behavior, vol.22, issue.2, pp.238-259, 1998.
DOI : 10.1006/game.1997.0582

M. W. Hirsch, S. Smale, and R. Devaney, Differential Equations, Dynamical Systems, and an Introduction to Chaos, 2003.

J. Hofbauer and K. Sigmund, Evolutionary game dynamics, Bulletin of the American Mathematical Society, vol.40, issue.04, pp.479-519, 2003.
DOI : 10.1090/S0273-0979-03-00988-1

J. Hofbauer and S. Sorin, Best response dynamics for continuous zero-sum games. Discrete and Continuous Dynamical Systems-Series B, 2006.

E. Koutsoupias and C. Papadimitriou, Worst-case equilibria, Symposium on Theoretical Computer Science (STACS'99), pp.404-413
DOI : 10.1007/3-540-49116-3_38

E. Koutsoupias, SELFISH TASK ALLOCATION, EATCS Bulletin, vol.81, 2003.
DOI : 10.1142/9789812562494_0008

L. Libman and A. Orda, Atomic resource sharing in noncooperative networks, Proceedings of INFOCOM '97, pp.385-409, 2001.
DOI : 10.1109/INFCOM.1997.631115

J. F. Nash, Equilibrium points in n-person games, Proc. of the National Academy of Sciences, pp.48-49, 1950.

A. Orda, R. Rom, and N. Shimkin, Competitive routing in multiuser communication networks, IEEE/ACM Transactions on Networking, vol.1, issue.5, pp.510-521, 1993.
DOI : 10.1109/90.251910

M. A. Thathachar, P. S. Sastry, and V. V. Phansalkar, Decentralized learning of Nash equilibria in multi-person stochastic games with incomplete information, IEEE transactions on system, man, and cybernetics, 1994.

B. Vöcking, Algorithmic Game Theory, chapter Selfish Load Balancing, 2007.

W. Jörgen and . Weibull, Evolutionary Game Theory, 1995.