H. Ackermann, P. Goldberg, V. Mirrokni, H. Röglin, and B. Vöcking, A Unified Approach to Congestion Games and Two-Sided Markets, Internet Mathematics, vol.5, issue.4, pp.439-457, 2008.
DOI : 10.1007/978-3-540-77105-0_7

H. Ackermann, H. Röglin, and B. Vöcking, On the impact of combinatorial structure on congestion games, J. ACM, vol.55, issue.6, 2008.

E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler et al., The Price of Stability for Network Design with Fair Cost Allocation, SIAM Journal on Computing, vol.38, issue.4, pp.1602-1623, 2008.
DOI : 10.1137/070680096

S. Bauer, D. Clark, and W. Lehr, The evolution of internet congestion, TPRC 2009, 37th research conference on Communication, Information and Internet policy, 2009.

A. Campbell, C. Aurrecoechea, and L. Hauw, A review of QoS architectures, ACM Multimedia Systems Journal, vol.6, pp.138-151, 1996.

S. Chien and A. Sinclair, Convergence to approximate Nash equilibria in congestion games, SODA, pp.169-178, 2007.
DOI : 10.1016/j.geb.2009.05.004

J. Correa, A. Schulz, and N. 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

E. Even-dar, A. Kesselman, and Y. Mansour, Convergence time to Nash equilibrium in load balancing, ACM Transactions on Algorithms, vol.3, issue.3, 2007.
DOI : 10.1145/1273340.1273348

A. Fabrikant, C. Papadimitriou, and K. Talwar, The complexity of pure Nash equilibria, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.604-612, 2004.
DOI : 10.1145/1007352.1007445

B. Farzad, N. Olver, and A. Vetta, A priority-based model of routing, Chicago J. Theor. Comput. Sci, vol.1, 2008.

D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, and P. Spirakis, The structure and complexity of nash equilibria for a selfish routing game, ICALP, pp.785-785, 2002.

M. Gairing, T. Lücking, M. Mavronicolas, and B. Monien, Computing nash equilibria for scheduling on restricted parallel links, STOC, pp.613-622, 2004.

M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

S. Ieong, R. Mcgrew, E. Nudelman, Y. Shoham, and Q. Sun, Fast and compact: A simple class of congestion games, AAAI, pp.489-494, 2005.

S. Mangold, S. Choi, P. May, O. Klein, G. Hiertz et al., IEEE 802.11e Wireless LAN for quality of service, Proc. European Wireless, pp.32-39, 2002.

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

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

R. 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

B. Vöcking, Congestion games: Optimization in competition, Texts in Algorithmics, vol.7, pp.9-20, 2006.