The price of stability for network design with fair cost allocation, Proc. of the 45th Annual Symposium on Foundations of Computer Science (FOCS), p.295304, 2004. ,
Network design with weighted players, Proc. of the 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'06) ,
On the Value of Coordination in Network Design, Proc. of the 19th annual ACM-SIAM symposium on Discrete algorithms (SODA), p.294303, 2008. ,
DOI : 10.1137/070701376
Strong equilibrium in cost sharing connection games, Proc. of the 8th ACM conference on Electronic commerce, p.8492, 2007. ,
Designing networks with good equilibria ,
Socially-Aware Network Design Games, 2010 Proceedings IEEE INFOCOM ,
DOI : 10.1109/INFCOM.2010.5462275
URL : https://hal.archives-ouvertes.fr/inria-00511915
From Altruism to Non-Cooperation in Routing Games, Proc. of Networking and Electronic Commerce Research Conference, 2009. ,
The Shapley Value. Game-Theoretic Methods in General Equilibrium Analysis, p.6166, 1994. ,
Bargaining theory with applications, 1999. ,
DOI : 10.1017/CBO9780511607950
The bargaining problem, Econometrica, vol.18, issue.2, p.155162, 1950. ,
Models of Network Formation in Cooperative Games, 2005. ,
DOI : 10.1017/CBO9780511614385.003
The price of anarchy in cooperative network creation games, Proc. of STACS 2009, p.301312, 2009. ,
DOI : 10.1145/1980522.1980524
URL : https://hal.archives-ouvertes.fr/inria-00359313
Strong price of anarchy, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007. ,
DOI : 10.1016/j.geb.2008.03.005
Fairness in network optimal ow control: Optimality of product forms, IEEE Trans. Comm, vol.39, issue.5, p.775782, 1991. ,
A game theoretic framework for bandwidth allocation and pricing in broadband networks, IEEE/ACM Transactions on Networking, vol.8, issue.5, p.667678, 2000. ,
DOI : 10.1109/90.879352
Fair Multiuser Channel Allocation for OFDMA Networks Using Nash Bargaining Solutions and Coalitions, IEEE Transactions on Communications, vol.53, issue.8, p.13661376, 2005. ,
DOI : 10.1109/TCOMM.2005.852826
Polynomial calculation of the Shapley value based on sampling, Computers & Operations Research, 2009. ,
DOI : 10.1016/j.cor.2008.04.004
Ecient distributed approximation algorithms via probabilistic tree embeddings, Proc. of the 27th symposium on Principles of Distributed Computing, p.263272, 2008. ,
DOI : 10.1007/s00446-012-0157-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.329.9746
A tight bound on approximating arbitrary metrics by tree metrics, Proceedings of the thirty-fifth ACM symposium on Theory of computing , STOC '03, p.485497, 2004. ,
DOI : 10.1145/780542.780608
Theory of games, 1998. ,
DOI : 10.1142/9824
Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt, Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex ,
BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399 ,