The Price of Stability for Network Design with Fair Cost Allocation
暂无分享,去创建一个
Tim Roughgarden | Éva Tardos | Jon M. Kleinberg | Elliot Anshelevich | Anirban Dasgupta | Tom Wexler | T. Roughgarden | J. Kleinberg | Anirban Dasgupta | É. Tardos | Elliot Anshelevich | T. Wexler
[1] T. Koopmans,et al. Studies in the Economics of Transportation. , 1956 .
[2] Robert W. Rosenthal,et al. The network equilibrium problem in integers , 1973, Networks.
[3] L. Shapley,et al. REGULAR ARTICLEPotential Games , 1996 .
[4] Deborah Estrin,et al. Sharing the “cost” of multicast trees: an axiomatic analysis , 1997, TNET.
[5] Frank Kelly,et al. Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..
[6] Christos H. Papadimitriou,et al. Worst-case equilibria , 1999 .
[7] Hans Haller,et al. Nash Networks with Heterogeneous Agents , 2000 .
[8] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[9] Christos H. Papadimitriou,et al. Algorithms, games, and the internet , 2001, STOC '01.
[10] H. Moulin,et al. Strategyproof sharing of submodular costs:budget balance versus efficiency , 2001 .
[11] Ariel Orda,et al. Atomic Resource Sharing in Noncooperative Networks , 2001, Telecommun. Syst..
[12] Noam Nisan,et al. Algorithmic Mechanism Design , 2001, Games Econ. Behav..
[13] Vijay V. Vazirani,et al. Applications of approximation algorithms to cooperative games , 2001, STOC '01.
[14] Joan Feigenbaum,et al. Sharing the Cost of Multicast Transmissions , 2001, J. Comput. Syst. Sci..
[15] Berthold Vöcking,et al. Selfish traffic allocation for server farms , 2002, STOC '02.
[16] Tim Roughgarden,et al. The price of anarchy is independent of the network topology , 2002, STOC '02.
[17] Berthold Vöcking,et al. Tight bounds for worst-case equilibria , 2002, SODA '02.
[18] Adrian Vetta,et al. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[19] Scott Shenker,et al. On a network creation game , 2003, PODC '03.
[20] Éva Tardos,et al. Near-optimal network design with selfish agents , 2003, STOC '03.
[21] José R. Correa,et al. Sloan School of Management Working Paper 4319-03 June 2003 Selfish Routing in Capacitated Networks , 2022 .
[22] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.
[23] Tim Roughgarden. Stackelberg Scheduling Strategies , 2004, SIAM J. Comput..
[24] Elias Koutsoupias,et al. The price of anarchy of finite congestion games , 2005, STOC '05.
[25] Yossi Azar,et al. The Price of Routing Unsplittable Flow , 2005, STOC '05.
[26] Elias Koutsoupias,et al. On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games , 2005, ESA.
[27] John N. Tsitsiklis,et al. Efficiency loss in a network resource allocation game: the case of elastic supply , 2004, IEEE Transactions on Automatic Control.
[28] Y. Mansour,et al. On Nash Equilibria for a Network Creation Game , 2006, TEAC.