H. Zhuge, Semantic linking through spaces for cyber-physical-socio intelligence: A methodology, Artificial Intelligence, vol.175, issue.5-6, pp.5-6, 2011.
DOI : 10.1016/j.artint.2010.09.009

B. S. Kerner, Introduction to Modern Traffic Flow Theory and Control: The Long Road to Three-Phase Traffic Theory, 2009.
DOI : 10.1007/978-3-642-02605-8

J. G. Wardrop, CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH., Proc. Institution of Civil Engineers, pp.325-78, 1952.
DOI : 10.1680/ipeds.1952.11362

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

M. Florian, S. Nguyen, and J. Ferland, On the Combined Distribution-Assignment of Traffic, Transportation Science, vol.9, issue.1, pp.43-53, 1975.
DOI : 10.1287/trsc.9.1.43

M. Frank and P. Wolfe, An algorithm for quadratic programming, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.95-110, 1956.
DOI : 10.1002/nav.3800030109

E. Altman, Flow control using the theory of zero sum Markov games, IEEE Transactions on Automatic Control, vol.39, issue.4, pp.814-832, 1994.
DOI : 10.1109/9.286259

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

Y. A. Korilis, A. A. Lazar, and A. Orda, Architecting noncooperative networks, IEEE Journal on Selected Areas in Communications, vol.15, issue.7, pp.1241-51, 1995.
DOI : 10.1109/eeis.1995.514185

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

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

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

Y. A. Korilis, A. A. Lazar, and A. Orda, Achieving network optima using Stackelberg routing strategies, IEEE/ACM Transactions on Networking, vol.5, issue.1, pp.161-73, 1997.
DOI : 10.1109/90.554730

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

Y. A. Korilis, A. A. Lazar, and A. Orda, Capacity allocation under noncooperative routing, IEEE Transactions on Automatic Control, vol.42, issue.3, pp.309-334, 1997.
DOI : 10.1109/9.557575

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

E. Altman and L. Wynter, Equilibrium, Games, and Pricing in Transportation and Telecommunication Networks, Networks and Spatial Economics, vol.4, issue.1, pp.7-21, 2004.
DOI : 10.1023/B:NETS.0000015653.52983.61

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

S. Lasaulce and H. Tembine, Game Theory and Learning for Wireless Networks: Fundamentals and Applications, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00661625

E. Altman, K. Avrachenkov, and A. Garnaev, A Jamming Game in Wireless Networks with Transmission Cost, Lecture Notes in Computer Science, vol.4465, pp.1-12, 2007.
DOI : 10.1007/978-3-540-72709-5_1

E. Altman, K. Avrachenkov, and A. Garnaev, Closed form solutions for water-filling problems in??optimization and??game frameworks, Telecommunication Systems, vol.20, issue.7, pp.153-64, 2009.
DOI : 10.1007/s11235-010-9308-0

E. Altman, T. Basar, and R. Srikant, Nash equilibria for combined flow control and routing in networks: asymptotic behavior for a large number of users, IEEE Transactions on automatic control, issue.6, pp.47-917, 2002.

W. K. Ching, A note on the convergence of asynchronous greedy algorithm with relaxation in a multiclass queueing environment, IEEE Communications Letters, vol.3, issue.2, pp.34-40, 1999.
DOI : 10.1109/4234.749354