C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou, The Complexity of Computing a Nash Equilibrium, SIAM Journal on Computing, vol.39, issue.1, pp.195-259, 2009.
DOI : 10.1137/070699652

J. Doncel, N. Gast, and B. Gaujal, Mean-field games with explicit interactions, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01277098

D. Gomes, J. Mohr, and R. Souza, Continuous Time Finite State Mean Field Games, Applied Mathematics & Optimization, vol.76, issue.6, pp.99-143, 2013.
DOI : 10.1007/s00245-013-9202-8

T. G. Kurtz, Approximation of population processes, SIAM, vol.36, 1981.
DOI : 10.1137/1.9781611970333

L. Laguzet and G. Turinici, Individual vaccination as Nash equilibrium in a SIR model : the interplay between individual optimization and societal policies, 2015.

J. Lasry and P. Lions, Mean field games, Japanese Journal of Mathematics, vol.4, issue.1, pp.229-260, 2007.
DOI : 10.1007/s11537-007-0657-8
URL : https://hal.archives-ouvertes.fr/hal-00667356

M. Larrañaga, O. J. Boxma, R. Nunez-queija, and M. S. , Squillante ? Efficient content delivery in the presence of impatient jobs, Proceedings of ITC 2015

P. Whittle and ?. , Restless bandits: activity allocation in a changing world, Journal of Applied Probability, vol.1, issue.A, pp.287-298, 1988.
DOI : 10.1214/aop/1176994469

B. Awerbuch, Y. Azar, and S. Plotkin, Throughputcompetitive on-line routing, Proc. FOCS, 1993.

N. Buchbinder and J. Naor, Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006.
DOI : 10.1109/FOCS.2006.39

T. Kesselheim, A. Tönnis, K. Radke, and B. Vöcking, Primal beats dual on online packing LPs in the random-order model, Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC '14, 2014.
DOI : 10.1145/2591796.2591810

S. Agrawal and N. R. Devanur, Fast Algorithms for Online Stochastic Convex Programming, Proc. ACM SODA, 2015.
DOI : 10.1137/1.9781611973730.93

D. P. De-farias and N. Megiddo, How to combine expert (and novice) advice when actions impact the environment?, Advances in Neural Information Processing Systems, 2003.

N. Cesa-bianchi and G. Lugosi, Prediction, Learning , and Games, 2006.
DOI : 10.1017/CBO9780511546921

S. Uhlig, B. Quoitin, J. Lepropre, and S. Balon, Providing public intradomain traffic matrices to the research community, ACM SIGCOMM Computer Communication Review, vol.36, issue.1, 2006.
DOI : 10.1145/1111322.1111341

V. Abramov, S. Li, M. Wang, E. W. Wong, and M. Zukerman, Computation of Blocking Probability for Large Circuit Switched Networks, IEEE Communications Letters, vol.16, issue.11, pp.161892-1895, 2012.
DOI : 10.1109/LCOMM.2012.092112.121557

H. Luiz, I. E. Bonani, and . Fonseca, Estimating the blocking probability in wavelengthrouted optical networks, Optical Switching and Networking, vol.10, issue.4, pp.430-438, 2013.

A. A. Saleh and J. M. Simmons, Technology and architecture to enable the explosive growth of the internet, IEEE Communications Magazine, vol.49, issue.1, pp.126-132, 2011.
DOI : 10.1109/MCOM.2011.5681026

A. Zapata-beghelli and P. Bayvel, Dynamic Versus Static Wavelength-Routed Optical Networks, Journal of Lightwave Technology, vol.26, issue.20, pp.3403-3415, 2008.
DOI : 10.1109/JLT.2008.925718