Non-cooperative multicast and facility location games

IEEE Journal on Selected Areas in Communications

Volumn 25, Issue 6, 2007, Pages 1193-1206

  Chekuri, Chandra ^a,b   Chuzhoy, Julia ^c   Lewin Eytan, Liane ^d   Naor, Joseph ^d,e   Orda, Ariel ^d  

^a University of Illinois at Urbana Champaign   (United States)

^b Lucent Bell Labs   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^e MICROSOFT RESEARCH   (United States)

Author keywords

Multicast game; Nash equilibrium; Price of anarchy; Price of stability

Indexed keywords

MULTICAST GAMES; NASH EQUILIBRIUM; PRICE OF ANARCHY; PRICE OF STABILITY;

COMPUTATIONAL COMPLEXITY; DECISION THEORY; MATHEMATICAL MODELS; MULTICASTING; ROUTING ALGORITHMS; USER INTERFACES;

INTERACTIVE COMPUTER GRAPHICS;

EID: 34547538270     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2007.070813     Document Type: Article

References (35)

1. M. Adler, D. Rubenstein, "Pricing multicasting in more practical network models", Proc. of ACM-SIAM SODA, 981-990, 2002.
2. M. Charikar, H. Karloff, C. Mathieu, J. Naor and M. Saks. Best response dynamics in multicast cost sharing. Manuscript, 2006.
3. R. Ahlswede, N. Cai, S.-Y. R. Li and R. W. Yeung, "Network information flow", IEEE Trans. Inform. Theory, Vol. 46, 1204-1216, 2000.
4. E. Anshelevich, A. Dasgupta, J. Kleinberg, É. Tardos, T. Wexler and T. Roughgarden, "The price of stability for network design with fair cost allocation", Proc. IEEE FOCS, 295-304, 2004.
5. A. Archer, J. Feigenbaum, A. Krishnamurthy, R. Sami and S. Shenker, "Approximation and collusion in multicast cost sharing", Proc. ACM EC, 253-255, 2001.
6. H.-L. Chen and T. Roughgarden. Network design with weighted players. Proc. 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2006, pp. 29-38.
7. J. Chuzhoy, A. Gupta, J. Naor and A. Sinha. On the approximability of some network design problems. ACM Transactions on Algorithms (TALG), to appear.
8. Preliminary version appeared in Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 943-951, 2005.
9. A. Fabrikant, C. Papadimitriou and K. Talwar, "The complexity of pure nash equilibria", Proc. ACM STOC, 604-612, 2004.
10. J. Feigenbaum, C. Papadimitriou and S. Shenker, "Sharing the cost of multicast transmission", Proc. ACM STOC, 218-227, 2000.
11. A. Fiat, H. Kaplan, M. Levy, S. Olonetsky and R. Shabo, "On the price of stability for designing undirected networks with fair cost allocations", Proc. ICALP, 608-618, 2006.
12. C.H. Helvig, G. Robins, and A. Zelikovsky, "Improved approximation scheme for the group Steiner problem", Networks, Vol. 37(1), 8-20, 2001.
13. S. Herzog, S. Shenker and D. Estrin, "Sharing the cost of multicast trees: An axiomatic analysis", IEEE/ACM Trans. Networking, Vol. 5, 847-860, 1997.
14. R. Holzman and N. Law-Yone, "Strong equilibrium in congestion games", Games and Economic Behavior, Vol. 21, 85-101, 1997.
15. M. Imaze and B. Waxman, "Dynamic steiner tree problem", SIAM J. on Discrete Mathematics, Vol. 4(3), 369-384, 1991.
16. K. Jain, and V. Vazirani, "Applications of approximation algorithms to cooperative games", Proc. ACM STOC, 364-372, 2001.
17. R. Johari and J.N. Tsitsiklis, "Efficiency loss in a network resource allocation game", to appear in Math, of Oper. Res.
18. S. Kakutani, "A generalization of Brouwer's Fixed Point Theorem", Duke Mathematical Journal, Vol. 8, 457-459, 1941.
19. R. Koetter and M. Medard, "An algebraic approach to network coding", IEE/ACM Trans. Networking, Vol. 11(5), 782-795, 2003.
20. Y.A. Korilis, A.A. Lazar and A. Orda, "Achieving network optima using Stackelberg routing strategies", IEEE/ACM Trans. Networking, Vol. 5(1), 161-173, 1997.
21. E. Koutsoupias and C. Papadimitriou, "Worst-case equilibria", Proc. of STACS, LNCS, 404-413, 1999.
22. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Lineal- network coding", IEEE Trans. Inform. Theory, Vol. 49, 371-381, 2003.
23. C. Lund and M. Yannakakis, "On the hardness of approximating minimization problems", JACM, Vol. 41(5), 960-981, 1994.
24. I. Milchtaich, "Congestion games with player specific payoff functions", Games and Economic Behavior, Vol. 13, 111-124, 1996.
25. V. Mirrokni and A. Vetta, "Convergence issues in competitive games", Proc. APPROX, LNCS, 183-194, 2004.
26. D. Monderer and L.S. Shapley, "Potential games", Games and Economic Behavior, Vol. 14, 124-143, 1996.
27. A. Orda, R. Rom and N. Shimkin, "Competitive routing in multi-user communication networks", IEEE/ACM Trans. Networking, Vol. 1, 614-627, 1993.
28. C. Papadimitriou, "Algorithms, games, and the Internet", Proc. ACM STOC, 749-753, 2001.
29. R.W. Rosenthal, "A class of games possessing pure strategy Nash. equilibria", International J. of Game Theory, Vol. 2, 65-67, 1973.
30. T. Roughgarden and É. Tardos, "How bad is selfish routing?", JACM, Vol. 49(2), 236-259, 2002.
31. T. Roughgarden, "The price of anarchy is independent of the network topology", Proc. ACM STOC, 428-437, 2002.
32. L.S. Shapley, A value for n-person games", Contribution, to the Theory of Games, 31-40, Princeton University Press, Princeton, 1953.
33. A.S. Schulz and N.E. Stier Moses, "On the performance of user equilibria in traffic networks", Proc. ACM-SIAM SODA, 86-87, 2003.
34. M. Voorneveld, P. Borm, F. van Megen, S. Tijs and G. Faccini, "Congestion games and potentials reconsidered", International Game Theory Review, Vol. 1, 283-299, 1999.
35. A. Zelikovsky, "A series of approximation algorithms for the acyclic directed steiner tree problem", Algorithmica, Vol. 18, 99-110, 1997.