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] Stefan Schmid,et al. On the topologies formed by selfish peers , 2006, PODC '06.
[2] Scott Shenker,et al. On a network creation game , 2003, PODC '03.
[3] Yossi Azar,et al. The Price of Routing Unsplittable Flow , 2005, STOC '05.
[4] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[5] José R. Correa,et al. Sloan School of Management Working Paper 4319-03 June 2003 Selfish Routing in Capacitated Networks , 2022 .
[6] Elias Koutsoupias,et al. The price of anarchy of finite congestion games , 2005, STOC '05.
[7] John N. Tsitsiklis,et al. Efficiency loss in a network resource allocation game: the case of elastic supply , 2004, IEEE Transactions on Automatic Control.
[8] Sanjeev Goyal,et al. A Noncooperative Model of Network Formation , 2000 .
[9] David C. Parkes,et al. The price of selfish behavior in bilateral network formation , 2005, PODC '05.
[10] Elias Koutsoupias,et al. On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games , 2005, ESA.
[11] Yishay Mansour,et al. On nash equilibria for a network creation game , 2014, SODA '06.
[12] P. Gács,et al. Algorithms , 1992 .
[13] Frank Kelly,et al. Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..
[14] Joan Feigenbaum,et al. Sharing the Cost of Multicast Transmissions , 2001, J. Comput. Syst. Sci..
[15] Hans Haller,et al. Nash Networks with Heterogeneous Agents , 2000 .
[16] Tim Roughgarden,et al. Network Design with Weighted Players , 2006, SPAA '06.
[17] Éva Tardos,et al. Near-optimal network design with selfish agents , 2003, STOC '03.
[18] Deborah Estrin,et al. Sharing the “cost” of multicast trees: an axiomatic analysis , 1995, SIGCOMM '95.
[19] H. Moulin,et al. Strategyproof sharing of submodular costs:budget balance versus efficiency , 2001 .
[20] Tim Roughgarden,et al. The price of anarchy is independent of the network topology , 2002, STOC '02.
[21] Vijay V. Vazirani,et al. Applications of approximation algorithms to cooperative games , 2001, STOC '01.
[22] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.
[23] 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..
[24] Berthold Vöcking,et al. Selfish traffic allocation for server farms , 2002, STOC '02.
[25] Christos H. Papadimitriou,et al. Algorithms, Games, and the Internet , 2001, ICALP.
[26] L. Shapley,et al. Potential Games , 1994 .
[27] Tim Roughgarden,et al. Stackelberg scheduling strategies , 2001, STOC '01.
[28] Robert W. Rosenthal,et al. The network equilibrium problem in integers , 1973, Networks.
[29] T. Koopmans,et al. Studies in the Economics of Transportation. , 1956 .
[30] D. Monderer,et al. Variations on the shapley value , 2002 .
[31] Ariel Orda,et al. Atomic Resource Sharing in Noncooperative Networks , 1997, Proceedings of INFOCOM '97.
[32] Berthold Vöcking,et al. Tight bounds for worst-case equilibria , 2002, SODA '02.
[33] Csaba D. Tóth,et al. Selfish Load Balancing and Atomic Congestion Games , 2004, SPAA '04.
[34] Angelo Fanelli,et al. Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves , 2006, MFCS.
[35] Haim Kaplan,et al. On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations , 2006, ICALP.