E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler et al., The price of stability for network design with fair cost allocation, Proc. of the 45th Annual Symposium on Foundations of Computer Science (FOCS), pp.295-304, 2004.

H. L. Chen and T. Roughgarden, Network design with weighted players, Proc. of the 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'06), 2006.
DOI : 10.1007/s00224-008-9128-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.208.8575

S. Albers, On the Value of Coordination in Network Design, Proc. of the 19th annual ACM-SIAM symposium on Discrete algorithms (SODA), pp.294-303, 2008.
DOI : 10.1137/070701376

A. Epstein, M. Feldman, and Y. Mansour, Strong equilibrium in cost sharing connection games, Proc. of the 8th ACM conference on Electronic commerce, pp.84-92, 2007.
DOI : 10.1016/j.geb.2008.07.002
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.7895

H. L. Chen, T. Roughgarden, and G. Valiant, Designing networks with good equilibria, Proc. of the 19th annual ACM-SIAM symposium on Discrete algorithms, pp.854-863, 2008.

J. Elias, F. Martignon, K. Avrachenkov, and G. Neglia, Socially-Aware Network Design Games, 2010 Proceedings IEEE INFOCOM
DOI : 10.1109/INFCOM.2010.5462275
URL : https://hal.archives-ouvertes.fr/inria-00511915

A. P. Azad, E. Altman, and R. Elazouzi, From Altruism to Non-Cooperation in Routing Games, Proc. of Networking and Electronic Commerce Research Conference, 2009.

R. J. Aumann, R. B. Myerson, and A. Roth, The Shapley Value. Game-Theoretic Methods in General Equilibrium Analysis, pp.61-66, 1994.

A. Muthoo, Bargaining theory with applications, 1999.
DOI : 10.1017/CBO9780511607950

J. F. Nash-jr, The Bargaining Problem, Econometrica, vol.18, issue.2, pp.155-162, 1950.
DOI : 10.2307/1907266

A. Van-den-nouweland, Models of Network Formation in Cooperative Games, 2005.
DOI : 10.1017/CBO9780511614385.003

E. D. Demaine, M. Hajiaghayi, H. Mahini, and M. Zadimoghaddam, The price of anarchy in cooperative network creation games, Proc. of STACS 2009, pp.301-312, 2009.
DOI : 10.1145/1980522.1980524
URL : https://hal.archives-ouvertes.fr/inria-00359313

N. Andelman, M. Feldman, and Y. Mansour, Strong price of anarchy, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007.
DOI : 10.1016/j.geb.2008.03.005

R. Mazumdar, L. G. Mason, and C. Douligeris, Fairness in network optimal flow control: optimality of product forms, IEEE Transactions on Communications, vol.39, issue.5, pp.775-782, 1991.
DOI : 10.1109/26.87140

H. Yaiche, R. R. Mazumdar, and C. Rosenberg, A game theoretic framework for bandwidth allocation and pricing in broadband networks, IEEE/ACM Transactions on Networking, vol.8, issue.5, pp.667-678, 2000.
DOI : 10.1109/90.879352

Z. Han, Z. Ji, K. J. Ray, and . Liu, Fair multiuser channel allocation for OFDMA networks using Nash bargaining solutions and coalitions, IEEE Transactions on Communications, vol.53, issue.8, pp.1366-1376, 2005.
DOI : 10.1109/TCOMM.2005.852826

K. Avrachenkov, J. Elias, F. Martignon, G. Neglia, and L. Petrosyan, A Nash Bargaining Solution for Cooperative Network Formation Games, 2010.
DOI : 10.1007/978-3-642-20757-0_24
URL : https://hal.archives-ouvertes.fr/inria-00544527

J. Castro, D. Gomez, and J. Tejada, Polynomial calculation of the Shapley value based on sampling, Computers & Operations Research, 2009.
DOI : 10.1016/j.cor.2008.04.004

M. Khan, F. Kuhn, D. Malkhi, G. Pandurangan, and K. Talwar, Efficient distributed approximation algorithms via probabilistic tree embeddings, Proc. of the 27th symposium on Principles of Distributed Computing, pp.263-272, 2008.
DOI : 10.1145/1400751.1400787
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.1320