H. Z. Aashtiani and T. L. Magnanti, Equilibria on a Congested Transportation Network, SIAM Journal on Algebraic Discrete Methods, vol.2, issue.3, pp.213-226, 1981.
DOI : 10.1137/0602024

E. Altman, T. Ba?ar, T. Jiménez, and N. Shimkin, Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms, Journal of Parallel and Distributed Computing, vol.61, issue.9, pp.1367-1381, 2001.
DOI : 10.1006/jpdc.2001.1754

URL : http://black.csl.uiuc.edu/~tbasar/jpdc2000.pdf

E. Altman, T. Ba?ar, T. Jiménez, and N. Shimkin, Competitive routing in networks with polynomial costs, IEEE Trans. Automat. Control, pp.47-92, 2002.
DOI : 10.1109/9.981725

URL : http://black.csl.uiuc.edu/~tbasar/AlBaJiSh_tac02.pdf

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, pp.1-5, 2007.
DOI : 10.1109/WIOPT.2007.4480096

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

E. Altman, H. Kameda, and Y. Hayel, Revisiting collusion in routing games : a load balancing problem, NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00644539

R. J. Aumann, Subjectivity and correlation in randomized strategies, Journal of Mathematical Economics, vol.1, issue.1, pp.67-96, 1974.
DOI : 10.1016/0304-4068(74)90037-8

R. J. Aumann and R. B. Myerson, Endogenous formation of links between players and of coalitions : an application of the Shapley value, The Shapley Value, pp.175-191, 1988.

B. Awerbuch, Y. Azar, and A. Epstein, The Price of Routing Unsplittable Flow, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp.57-66, 2005.
DOI : 10.1137/070702370

M. Beckmann, C. B. Mcguire, and C. B. Winston, Studies in the Economics of Transportation, 1956.

U. Bhaskar, L. Fleischer, D. Hoy, and C. Huang, Equilibria of Atomic Flow Games are not Unique, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp.748-757, 2009.
DOI : 10.1137/1.9781611973068.82

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

U. Bhaskar, L. Fleischer, and C. Huang, The Price of Collusion in Series-Parallel Networks, Integer Programming and Combinatorial Optimization, pp.313-326, 2010.
DOI : 10.1007/978-3-642-13036-6_24

F. Bloch, Noncooperative models of coalition formation in games with spillovers . In New Directions in the Economic Theory of the Environment, pp.311-352, 1997.

F. Bloch and S. Ghosal, Buyers' and sellers' cartels on markets with indivisible goods, Review of Economic Design, vol.5, issue.2, pp.129-147, 2000.
DOI : 10.1007/s100580000018

I. M. Bomze, Non-cooperative two-person games in biology: A classification, International Journal of Game Theory, vol.89, issue.1, pp.31-57, 1986.
DOI : 10.1007/BF01769275

T. Boulogne, E. Altman, H. Kameda, and O. Pourtallier, Mixed equilibrium (ME) for multiclass routing games, IEEE Transactions on Automatic Control, vol.47, issue.6, pp.47-903, 2002.
DOI : 10.1109/TAC.2002.1008357

D. Braess, Über ein Paradoxon aus der Verkehrsplanung, pp.258-268, 1968.
DOI : 10.1007/bf01918335

M. Bravo and C. Wan, A dynamical model of a two-scale interaction, 2012.

C. K. Chau and K. M. Sim, The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands, Operations Research Letters, vol.31, issue.5, pp.327-334, 2003.
DOI : 10.1016/S0167-6377(03)00030-0

G. Christodoulou and E. Koutsoupias, The price of anarchy of finite congestion games, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing , STOC '05, pp.67-73, 2005.
DOI : 10.1145/1060590.1060600

R. Cominetti, J. R. Correa, and N. E. Stier-moses, The Impact of Oligopolistic Competition in Networks, Operations Research, vol.57, issue.6, pp.1421-1437, 2009.
DOI : 10.1287/opre.1080.0653

R. Cominetti, E. Melo, and S. Sorin, A payoff-based learning procedure and its application to traffic games, Games and Economic Behavior, vol.70, issue.1, pp.71-83, 2010.
DOI : 10.1016/j.geb.2008.11.012

J. R. Correa, A. S. Schulz, and N. E. Stier-moses, Selfish Routing in Capacitated Networks, Mathematics of Operations Research, vol.29, issue.4, pp.961-976, 2004.
DOI : 10.1287/moor.1040.0098

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

J. R. Correa, A. S. Schulz, and N. E. Stier-moses, A geometric approach to the price of anarchy in nonatomic congestion games, Games and Economic Behavior, vol.64, issue.2, pp.457-469, 2008.
DOI : 10.1016/j.geb.2008.01.001

J. R. Correa and N. E. Stier-moses, Wardrop Equilibria, Wiley Encyclopedia of Operations Research and Management Science, 2010.
DOI : 10.1002/9780470400531.eorms0962

R. Cressman, Evolutionary Dynamics and Extensive Form Games, 2003.

R. Cressman, A. T. Dash, and E. Akin, Evolutionary games and two species population dynamics, Journal of Mathematical Biology, vol.16, issue.2, pp.221-230, 1986.
DOI : 10.1007/BF00276958

S. Dafermos, Traffic Equilibrium and Variational Inequalities, Transportation Science, vol.14, issue.1, pp.42-54, 1980.
DOI : 10.1287/trsc.14.1.42

S. Dafermos and F. T. Sparrow, Traffic assignment problem for a general network, Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences, vol.73, issue.2, pp.73-91, 1969.
DOI : 10.6028/jres.073B.010

R. J. Duffin, Topology of series-parallel networks, Journal of Mathematical Analysis and Applications, vol.10, issue.2, pp.303-318, 1965.
DOI : 10.1016/0022-247X(65)90125-3

D. Fotakis, S. Kontogiannis, and P. Spirakis, Selfish unsplittable flows, Theoretical Computer Science, vol.348, issue.2-3, pp.226-239, 2005.
DOI : 10.1016/j.tcs.2005.09.024

G. Hardin, The Tragedy of the Commons???, Journal of Natural Resources Policy Research, vol.10, issue.3, pp.1243-1248, 1968.
DOI : 10.1002/bs.3830010402

P. T. Harker, Multiple Equilibrium Behaviors on Networks, Transportation Science, vol.22, issue.1, pp.39-46, 1988.
DOI : 10.1287/trsc.22.1.39

T. Harks, The impact of collusion on the price of anarchy in nonatomic and discrete network games, 2008.

T. Harks, Stackelberg Strategies and Collusion in Network Games with Splittable Flow, Theory of Computing Systems, vol.1, issue.Part II, pp.781-802, 2011.
DOI : 10.1007/s00224-010-9269-4

S. Hart, Formation of cartels in large markets, Journal of Economic Theory, vol.7, issue.4, pp.453-466, 1974.
DOI : 10.1016/0022-0531(74)90114-8

A. Haurie and P. Marcotte, On the relationship between Nash-Cournot and Wardrop equilibria. Networks, pp.295-308, 1985.

A. Hayrapetyan, É. Tardos, and T. Wexler, The effect of collusion in congestion games (extended abstract), Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp.89-98, 2006.

J. Hofbauer, Evolutionary dynamics for bimatrix games: A Hamiltonian system?, Journal of Mathematical Biology, vol.43, issue.Nr. 421, pp.675-688, 1996.
DOI : 10.1007/BF02409754

J. Hofbauer, From Nash and Brown to Maynard Smith: Equilibria, Dynamics and ESS, Selection, vol.1, issue.1-3, pp.81-88, 2001.
DOI : 10.1556/Select.1.2000.1-3.8

J. Hofbauer and W. T. Sandholm, Stable games and their dynamics, Journal of Economic Theory, vol.144, issue.4, pp.1665-1693, 2009.
DOI : 10.1016/j.jet.2009.01.007

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

J. Hofbauer, P. Schuster, and K. Sigmund, A note on evolutionary stable strategies and game dynamics, Journal of Theoretical Biology, vol.81, issue.3, pp.81-609, 1979.
DOI : 10.1016/0022-5193(79)90058-4

J. Hofbauer and K. Sigmund, The Theory of Evolution and Dynamical Systems, 1988.

J. Hofbauer and K. Sigmund, Evolutionary Games and Population Dynamics, 1998.
DOI : 10.1017/CBO9781139173179

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, S. Sorin, and Y. Viossat, Time Average Replicator and Best-Reply Dynamics, Mathematics of Operations Research, vol.34, issue.2, pp.263-269, 2009.
DOI : 10.1287/moor.1080.0359

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

C. Huang, Collusion in atomic splittable routing games, Proceedings of the 38th International Conference on Automata, Languages and Programming, pp.564-575, 2011.

C. Huang, Collusion in atomic splittable routing games, 2012.

M. O. Jackson and A. Watts, On the formation of interaction networks in social coordination games, Games and Economic Behavior, vol.41, issue.2, pp.265-291, 2002.
DOI : 10.1016/S0899-8256(02)00504-3

D. Kinderlehrer and G. Stampacchia, An Introduction to Variational Inequalities and Their Applications, 2000.
DOI : 10.1137/1.9780898719451

E. Koutsoupias and C. Papadimitriou, Worst-case equilibria, 16th Annual Symposium on Theoretical Aspects of Computer Science, pp.404-413, 1999.

L. Libman and A. Orda, Atomic resource sharing in noncooprerative networks, Telecommunication Systems, vol.17, issue.4, pp.385-409, 2001.
DOI : 10.1023/A:1016770831869

O. L. Mangasarian, A simple characterization of solution sets of convex programs, Operations Research Letters, vol.7, issue.1, pp.21-26, 1988.
DOI : 10.1016/0167-6377(88)90047-8

M. Mavronicolas, I. Milchtaich, B. Monien, and K. Tiemann, Congestion Games with Player-Specific Constants, In Mathematical Foundations of Computer Science, pp.633-644, 2007.
DOI : 10.1007/978-3-540-74456-6_56

M. Smith and J. , Group Selection and Kin Selection, Nature, vol.2, issue.4924, pp.1145-1147, 1964.
DOI : 10.1038/2011145a0

M. Smith and J. , The theory of games and the evolution of animal conflicts, 1974.

M. Smith and J. , . M. E. Gilpin, The Quarterly Review of Biology, vol.51, issue.2, pp.277-283, 1976.
DOI : 10.1086/409311

URL : https://hal.archives-ouvertes.fr/in2p3-00009449

M. Smith and J. , Evolution and the Theory of Games, 1982.
DOI : 10.1017/CBO9780511806292

M. Smith and G. R. Price, The Logic of Animal Conflict, Nature, vol.62, issue.5427, pp.15-18, 1973.
DOI : 10.1038/246015a0

G. B. Mertzios, Fast convergence of routing games with splittable flows, International Conference on Theoretical and Mathematical Foundations of Computer Science. ISRST, pp.28-33, 2009.

I. Milchtaich, Congestion Games with Player-Specific Payoff Functions, Games and Economic Behavior, vol.13, issue.1, pp.111-124, 1996.
DOI : 10.1006/game.1996.0027

I. Milchtaich, Topological Conditions for Uniqueness of Equilibrium in Networks, Mathematics of Operations Research, vol.30, issue.1, pp.225-244, 2005.
DOI : 10.1287/moor.1040.0122

D. Monderer and L. S. Shapley, Potential games. Games Econom, Behav, vol.14, pp.124-143, 1996.

R. B. Myerson, Graphs and Cooperation in Games, Mathematics of Operations Research, vol.2, issue.3, pp.225-229, 1977.
DOI : 10.1287/moor.2.3.225

J. H. Nachbar, ???Evolutionary??? selection dynamics in games: Convergence and limit properties, International Journal of Game Theory, vol.89, issue.1, pp.59-89, 1990.
DOI : 10.1007/BF01753708

A. Neyman, Correlated equilibrium and potential games, International Journal of Game Theory, vol.2, issue.2, pp.223-227, 1997.
DOI : 10.1007/BF01295851

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

C. Papadimitriou, Algorithms, games, and the internet, Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp.749-753, 2001.

M. Patriksson, The Traffic Assignment Problem ? Models and Methods, V.S.P, 1994.

G. Perakis, The ???Price of Anarchy??? Under Nonlinear and Asymmetric Costs, Mathematics of Operations Research, vol.32, issue.3, pp.614-628, 2007.
DOI : 10.1287/moor.1070.0258

M. Plank, Some qualitative differences between the replicator dynamics of two player and n player games, Nonlinear Analysis: Theory, Methods & Applications, vol.30, issue.3, pp.1411-1417, 1997.
DOI : 10.1016/S0362-546X(97)00202-2

O. Richman and N. Shimkin, Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users, Mathematics of Operations Research, vol.32, issue.1, pp.215-232, 2007.
DOI : 10.1287/moor.1060.0229

K. Ritzberger, The theory of normal form games from the differentiable viewpoint, International Journal of Game Theory, vol.11, issue.3, pp.207-236, 1994.
DOI : 10.1007/BF01247316

K. Ritzberger and J. Weibull, Evolutionary Selection in Normal-Form Games, Econometrica, vol.63, issue.6, pp.1371-1399, 1995.
DOI : 10.2307/2171774

R. W. Rosenthal, A class of games possessing pure-strategy Nash equilibria, International Journal of Game Theory, vol.2, issue.1, pp.65-67, 1973.
DOI : 10.1007/BF01737559

T. Roughgarden, The price of anarchy is independent of the network topology, Journal of Computer and System Sciences, vol.67, issue.2, 2003.
DOI : 10.1016/S0022-0000(03)00044-8

T. Roughgarden, Selfish routing with atomic players, Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1184-1185, 2005.

T. Roughgarden and F. Schoppmann, Local Smoothness and the Price of Anarchy in Atomic Splittable Congestion Games, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp.255-267, 2011.
DOI : 10.1137/1.9781611973082.22

T. Roughgarden and É. Tardos, How bad is selfish routing?, Journal of the ACM, vol.49, issue.2, pp.236-259, 2002.
DOI : 10.1145/506147.506153

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

W. H. Sandholm, Potential Games with Continuous Player Sets, Journal of Economic Theory, vol.97, issue.1, pp.81-108, 2001.
DOI : 10.1006/jeth.2000.2696

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

W. H. Sandholm, Pairwise Comparison Dynamics and Evolutionary Foundations for Nash Equilibrium, Games, vol.1, issue.1, pp.3-17, 2010.
DOI : 10.3390/g1010003

W. H. Sandholm, Population Games and Evolutionary Dynamics, 2011.

D. Schmeidler, Equilibrium points of nonatomic games, Journal of Statistical Physics, vol.36, issue.4, pp.295-300, 1973.
DOI : 10.1007/BF01014905

R. Selten, Reexamination of the perfectness concept for equilibrium points in extensive games, International Journal of Game Theory, vol.2, issue.1, pp.25-55, 1975.
DOI : 10.1007/BF01766400

M. J. Smith, The existence, uniqueness and stability of traffic equilibria, Transportation Research Part B: Methodological, vol.13, issue.4, pp.295-304, 1979.
DOI : 10.1016/0191-2615(79)90022-5

M. J. Smith, The Stability of a Dynamic Model of Traffic Assignment???An Application of a Method of Lyapunov, Transportation Science, vol.18, issue.3, pp.245-252, 1984.
DOI : 10.1287/trsc.18.3.245

S. Sorin, Exponential weight algorithm in continuous time, Mathematical Programming, vol.108, issue.1-2, pp.513-528, 2009.
DOI : 10.1007/s10107-007-0111-y

S. Sorin and C. Wan, Delegation equilibrium payoffs in integer-splitting games, RAIRO - Operations Research, vol.47, issue.1, 2012.
DOI : 10.1051/ro/2013026

P. D. Taylor, Evolutionarily stable strategies with two types of player, J, 1979.

P. D. Taylor and L. B. Jonker, Evolutionary stable strategies and game dynamics, Mathematical Biosciences, vol.40, issue.1-2, pp.145-156, 1978.
DOI : 10.1016/0025-5564(78)90077-9

C. Wan, Coalitions in Nonatomic Network Congestion Games, Mathematics of Operations Research, vol.37, issue.4, 2011.
DOI : 10.1287/moor.1120.0552

URL : http://arxiv.org/abs/1203.5822

C. Wan, Composition of the players in two-parallel-arc congestion games, 2012.

C. Wan, One-shot delegation games and delegation processes, 2012.

J. G. Wardrop, CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH., Proceedings of the Institute of Civil Engineers, Part II, pp.325-378, 1952.
DOI : 10.1680/ipeds.1952.11362

J. W. Weibull, Evolutionary Game Theory, 1995.

D. S. Wilson, A theory of group selection., Proc. Nat. Acad. Sci. USA, pp.72-143, 1975.
DOI : 10.1073/pnas.72.1.143

D. S. Wilson, Altruism in Mendelian Populations Derived from Sibling Groups: The Haystack Model Revisited, Evolution, vol.41, issue.5, pp.41-1059, 1987.
DOI : 10.2307/2409191

D. S. Wilson and L. A. Dugatkin, Group Selection and Assortative Interactions, The American Naturalist, vol.149, issue.2, pp.336-351, 1997.
DOI : 10.1086/285993