F. Abed and C. Huang, Preemptive Coordination Mechanisms for Unrelated Machines, Proc. of the 20th European Symposium on Algorithms, 2012.
DOI : 10.1007/978-3-642-33090-2_3

Y. Azar, K. Jain, S. Vahab, and . Mirrokni, Almost) optimal coordination mechanisms for unrelated machine scheduling, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.323-332, 2008.

K. Bhawalkar, M. Gairing, and T. Roughgarden, Weighted Congestion Games, Proceedings of the 18th Annual European Symposium on Algorithms (ESA), pp.17-28, 2010.
DOI : 10.1145/2629666

I. Caragiannis, Efficient coordination mechanisms for unrelated machine scheduling, Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.815-824, 2009.

G. Christodoulou, E. Koutsoupias, and A. Nanavati, Coordination mechanisms, Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP), pp.345-357, 2004.

R. Cole, J. R. Correa, V. Gkatzelis, V. S. Mirrokni, and N. Olver, Inner product spaces for MinSum coordination mechanisms, Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pp.539-548, 2011.
DOI : 10.1145/1993636.1993708

L. Fleischer and Z. Svitkina, Preference-constrained oriented matching, Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp.56-65, 2010.
DOI : 10.1137/1.9781611973006.9

L. Gourvès, J. Monnot, S. Moretti, and N. Thang, Congestion games with capacitated resources, Proc. of the 5th Symposium on Algorithmic Game Theory, 2012.

N. Immorlica, L. Li, V. S. Mirrokni, and A. S. Schulz, Coordination mechanisms for selfish scheduling, Theor. Comput. Sci, issue.17, pp.4101589-1598, 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

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

T. Roughgarden, Intrinsic robustness of the price of anarchy, Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pp.513-522, 2009.

T. Roughgarden and F. Schoppmann, Local Smoothness and the Price of Anarchy in Atomic Splittable Congestion Games, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2011.
DOI : 10.1137/1.9781611973082.22

A. Silberschatz and P. Galvin, Operating System Concepts, 1994.

S. Suri, C. D. Tóth, and Y. Zhou, Selfish Load Balancing and Atomic Congestion Games, Algorithmica, vol.47, issue.1, pp.79-96, 2007.
DOI : 10.1007/s00453-006-1211-4

A. S. Tanenbaum, Modern Operating Systems, 2007.