U. Ayesta, O. Brun, and B. J. Prabhu, Price of anarchy in non-cooperative load-balancing games. Performance Evaluation, pp.1312-1332, 2011.

C. H. Bell and S. Stidham, Individual versus Social Optimization in the Allocation of Customers to Alternative Servers, Management Science, vol.29, issue.7, pp.831-839, 1983.
DOI : 10.1287/mnsc.29.7.831

D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, 1989.

H. L. Chen, J. Marden, and A. Wierman, The effect of local scheduling in load balancing designs, Proceedings of IEEE Infocom, 2009.
DOI : 10.1145/1453175.1453200

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, 2005.
DOI : 10.1145/1060590.1060600

J. Doncel, U. Ayesta, O. Brun, and B. Prabhu, On the efficiency of non-cooperative load balancing, Proceedings of IFIP Networking, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00768339

M. Haviv and T. Roughgarden, The price of anarchy in an exponential multi-server, Operations Research Letters, vol.35, issue.4, pp.421-426, 2007.
DOI : 10.1016/j.orl.2006.09.005

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, 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, Architecting noncooperative networks, IEEE J.Sel. A. Commun, vol.13, issue.7, 2006.
DOI : 10.1109/eeis.1995.514185
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1032.2728

E. Koutsoupias and C. H. Papadimitriou, Worst-case equilibria, STACS 1999, 1999.
DOI : 10.1016/j.cosrev.2009.04.003

R. Miller, Google unveils its container data center, 2009.

R. Miller, Who has the most web servers?, 2009.

D. Mosk-aoyama, T. Roughgarden, and D. Shah, Fully distributed algorithms for convex optimization problems, SIAM Journal on Optimization, 2010.
DOI : 10.1007/978-3-540-75142-7_41
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.2878

T. Roughgarden, Selfish Routing and the Price of Anarchy, 2005.
DOI : 10.1017/CBO9781316779309.012

T. Roughgarden, Intrinsic robustness of the price of anarchy, Proceedings of the 41st annual ACM symposium on Theory of computing, 2009.

S. Suri, C. D. Tóth, and Y. Zhou, Selfish load balancing and atomic congestion games, Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, 2004.
DOI : 10.1007/s00453-006-1211-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.7186

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