On nash equilibria for a network creation game
暂无分享,去创建一个
Yishay Mansour | Susanne Albers | Liam Roditty | Eyal Even-Dar | Stefan Eilts | Y. Mansour | Eyal Even-Dar | S. Albers | Stefan Eilts | Liam Roditty | L. Roditty
[1] J. Nash. NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.
[2] Frank Harary,et al. Graph Theory , 2016 .
[3] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[4] A. Blokhuis,et al. Geodetic Graphs of Diameter Two , 1988 .
[5] A. Blokhuis,et al. Geodetic graphs of diameter two , 1988 .
[6] Christos H. Papadimitriou,et al. Worst-case equilibria , 1999 .
[7] Hans Haller,et al. Nash Networks with Heterogeneous Agents , 2000 .
[8] Sanjeev Goyal,et al. A Noncooperative Model of Network Formation , 2000 .
[9] Vijay V. Vazirani,et al. Applications of approximation algorithms to cooperative games , 2001, STOC '01.
[10] Berthold Vöcking,et al. Selfish traffic allocation for server farms , 2002, STOC '02.
[11] Berthold Vöcking,et al. Tight bounds for worst-case equilibria , 2002, SODA '02.
[12] Tim Roughgarden,et al. How bad is selfish routing? , 2002, JACM.
[13] Paul G. Spirakis,et al. The structure and complexity of Nash equilibria for a selfish routing game , 2002, Theor. Comput. Sci..
[14] M. Jackson. A Survey of Models of Network Formation: Stability and Efficiency , 2003 .
[15] Scott Shenker,et al. On a network creation game , 2003, PODC '03.
[16] Éva Tardos,et al. Group strategy proof mechanisms via primal-dual algorithms , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[17] Éva Tardos,et al. Near-optimal network design with selfish agents , 2003, STOC '03.
[18] José R. Correa,et al. Sloan School of Management Working Paper 4319-03 June 2003 Selfish Routing in Capacitated Networks , 2022 .
[19] Aravind Srinivasan,et al. Cost-Sharing Mechanisms for Network Design , 2004, APPROX-RANDOM.
[20] Tim Roughgarden,et al. The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[21] David C. Parkes,et al. The price of selfish behavior in bilateral network formation , 2005, PODC '05.
[22] Y. Mansour,et al. On Nash Equilibria for a Network Creation Game , 2006, TEAC.
[23] John N. Tsitsiklis,et al. A contract-based model for directed network formation , 2006, Games Econ. Behav..
[24] Tim Roughgarden,et al. Network Design with Weighted Players , 2006, SPAA '06.
[25] Yishay Mansour,et al. A Network Creation Game with Nonuniform Interests , 2007, WINE.
[26] Yishay Mansour,et al. Strong price of anarchy , 2007, SODA '07.
[27] Aravind Srinivasan,et al. Cost-Sharing Mechanisms for Network Design , 2007, Algorithmica.
[28] Rajmohan Rajaraman,et al. Bounded budget connection (BBC) games or how to make friends and influence people, on a budget , 2008, PODC '08.
[29] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .