A. Haurie and P. Marcotte, On the relationship between Nash?Cournot and Wardrop equilibria, Networks, vol.1, issue.04, pp.295-308, 1985.
DOI : 10.1002/net.3230150303

A. Orda, R. Rom, and N. Shimkin, Competitive routing in multi-user environments, IEEE/ACM Trans. on Networking, pp.510-521, 1993.

M. Patriksson, The traffic assignment problem: Models and methods, VSP, 1994.

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

J. G. Wardrop, Some theoretical aspects of road traffic research communication networks, Proc. Inst. Civ. Eng., Part, vol.2, issue.1, pp.325-378, 1952.

K. Park, M. Sitharam, and S. Chen, Quality of service provision in noncooperative networks with diverse user requirements, Decision Support Systems, vol.28, issue.1-2, pp.101-122, 2000.
DOI : 10.1016/S0167-9236(99)00078-0

U. Ayesta, O. Brun, and B. J. Prabhu, Price of Anarchy in Non-Cooperative Load Balancing, Proceedings of IEEE INFOCOM, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00416123

R. Cominetti, J. R. Correa, and N. E. Stier-moses, The Impact of Oligopolistic Competition in Networks, Operation Reserach,INFORMS, vol.57, issue.6, pp.1421-1437, 2009.

D. Monderer and L. S. Shapley, Potential Games, Games and Economic Behavior, vol.14, issue.1, pp.124-143, 1996.
DOI : 10.1006/game.1996.0044

M. K. Hanawal, E. Altman, R. El-azouzi, and B. J. Prabhu, Spatio-temporal Control for Dynamic Routing Games, Proceedings of Game Theory for Networks (GameNets), 2011.
DOI : 10.1016/0191-2615(90)90038-Z

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

E. Altman, K. Avrachenkov, N. Bonneau, M. Debbah, R. El-azouzi et al., Constrained cost-coupled stochastic games with independent state processes, Operations Research Letters, vol.36, issue.2, pp.160-164, 2008.
DOI : 10.1016/j.orl.2007.05.010

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

E. Altman, T. Basar, T. Jimenez, and N. Shimkin, Competitive routing in networks with polynomial costs, IEEE Transactions on Automatic Control, vol.47, issue.1, pp.92-96, 2002.
DOI : 10.1109/9.981725

H. Kameda and O. Pourtallier, Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers, Journal of the ACM, vol.49, issue.3, pp.407-433, 2002.
DOI : 10.1145/567112.567113

J. G. Wardrop, Some theoretical aspects of road traffic research communication networks, Proc. Inst. Civ. Eng., Part, vol.2, issue.1, pp.325-378, 1952.

M. Patriksson, The traffic assignment problem: Models and methods, VSP, 1994.

A. Orda, R. Rom, and N. Shimkin, Competitive routing in multi-user environments, IEEE/ACM Trans. on Networking, pp.510-521, 1993.

A. Haurie and P. Marcotte, On the relationship between Nash?Cournot and Wardrop equilibria, Networks, vol.1, issue.04, pp.295-308, 1985.
DOI : 10.1002/net.3230150303

K. Park, M. Sitharam, and S. Chen, Quality of service provision in noncooperative networks with diverse user requirements, Decision Support Systems, vol.28, issue.1-2, pp.101-122, 2000.
DOI : 10.1016/S0167-9236(99)00078-0

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

M. Haddad, E. Altman, and J. Gaillard, Sequential routing game on the line: Transmit or relay?, 2012 International Conference on Communications and Information Technology (ICCIT), 2012.
DOI : 10.1109/ICCITechnol.2012.6285812

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

M. K. Hanawal, E. Altman, R. El-azouzi, and B. J. Prabhu, Spatio-temporal Control for Dynamic Routing Games, Proceedings of Game Theory for Networks (GameNets), 2011.
DOI : 10.1016/0191-2615(90)90038-Z

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

E. Altman, T. Basar, T. Jimenez, and N. Shimkin, Competitive routing in networks with polynomial costs, IEEE Transactions on Automatic Control, vol.47, issue.1, pp.92-96, 2002.
DOI : 10.1109/9.981725

E. Altman, J. Kuri, and R. El-azouzi, A routing game in networks with lossy links, 7th International Conference on NETwork Games COntrol and OPtimization (NETGCOOP), 2014.
URL : https://hal.archives-ouvertes.fr/hal-01066453

H. Kameda and O. Pourtallier, Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers, Journal of the ACM, vol.49, issue.3, pp.407-433, 2002.
DOI : 10.1145/567112.567113

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

T. Roughgarden, The Price of Anarchy, 2005.

B. W. Wie, T. Friesz, and R. Tobin, Dynamic user optimal traffic assignment on congested multidestination networks, Transportation Research Part B: Methodological, vol.24, issue.6, pp.431-442, 1990.
DOI : 10.1016/0191-2615(90)90038-Z