Non-Cooperative Multicast and Facility Location Games
暂无分享,去创建一个
Joseph Naor | Ariel Orda | Chandra Chekuri | Julia Chuzhoy | Liane Lewin-Eytan | A. Orda | J. Naor | C. Chekuri | L. Lewin-Eytan | Julia Chuzhoy
[1] Joan Feigenbaum,et al. Approximation and collusion in multicast cost sharing (extended abstract) , 2001, EC '01.
[2] Christos H. Papadimitriou,et al. Algorithms, games, and the internet , 2001, STOC '01.
[3] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.
[4] Deborah Estrin,et al. Sharing the “cost” of multicast trees: an axiomatic analysis , 1995, SIGCOMM '95.
[5] L. Shapley,et al. Potential Games , 1994 .
[6] Vahab S. Mirrokni,et al. Convergence Issues in Competitive Games , 2004, APPROX-RANDOM.
[7] 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.
[8] Tim Roughgarden,et al. How bad is selfish routing? , 2002, JACM.
[9] Ariel Orda,et al. Competitive routing in multi-user communication networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.
[10] Mark Voorneveld,et al. Congestion Games and Potentials Reconsidered , 1999, IGTR.
[11] Joan Feigenbaum,et al. Approximation and collusion in multicast cost sharing , 2003, EC '03.
[12] Amit Agarwal,et al. On the advantage of network coding for improving network throughput , 2004, ITW.
[13] Ariel Orda,et al. Competitive routing in multiuser communication networks , 1993, TNET.
[14] Haim Kaplan,et al. On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations , 2006, ICALP.
[15] Muriel Médard,et al. An algebraic approach to network coding , 2003, TNET.
[16] Tim Roughgarden,et al. Network design with weighted players , 2006, SPAA.
[17] P. Gács,et al. Algorithms , 1992 .
[18] O. Rozenfeld. Strong Equilibrium in Congestion Games , 2007 .
[19] John N. Tsitsiklis,et al. Efficiency loss in a network resource allocation game: the case of elastic supply , 2004, IEEE Transactions on Automatic Control.
[20] Christos H. Papadimitriou,et al. Worst-case Equilibria , 1999, STACS.
[21] I. Milchtaich,et al. Congestion Games with Player-Specific Payoff Functions , 1996 .
[22] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[23] S. Kakutani. A generalization of Brouwer’s fixed point theorem , 1941 .
[24] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.
[25] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[26] Shuo-Yen Robert Li,et al. Linear network coding , 2003, IEEE Trans. Inf. Theory.
[27] L. Shapley. A Value for n-person Games , 1988 .
[28] Eric van Damme,et al. Non-Cooperative Games , 2000 .
[30] Tim Roughgarden,et al. Network Design with Weighted Players , 2006, SPAA '06.
[31] Andreas S. Schulz,et al. On the performance of user equilibria in traffic networks , 2003, SODA '03.
[32] Tim Roughgarden,et al. The price of anarchy is independent of the network topology , 2002, STOC '02.
[33] Vijay V. Vazirani,et al. Applications of approximation algorithms to cooperative games , 2001, STOC '01.
[34] Alex Zelikovsky,et al. An improved approximation scheme for the Group Steiner Problem , 2001, Networks.
[35] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.
[36] Joan Feigenbaum,et al. Sharing the cost of muliticast transmissions (preliminary version) , 2000, STOC '00.
[37] A. Zelikovsky,et al. An improved approximation scheme for the Group Steiner Problem , 2001 .
[38] Micah Adler,et al. Pricing multicasting in more practical network models , 2002, SODA '02.
[39] Ariel Orda,et al. Achieving network optima using Stackelberg routing strategies , 1997, TNET.
[40] Alex Zelikovsky,et al. A series of approximation algorithms for the acyclic directed steiner tree problem , 1997, Algorithmica.
[41] S. Vajda,et al. Contribution to the Theory of Games , 1951 .
[42] Makoto Imase,et al. Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..
[43] Joseph Naor,et al. On the approximability of some network design problems , 2005, SODA '05.
[44] ShenkerScott,et al. Sharing the Cost of Multicast Transmissions , 2001 .