Exact and approximate equilibria for optimal group network formation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5757 LNCS, Issue , 2009, Pages 239-250

  Anshelevich, Elliot ^a   Caskurlu, Bugra ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EQUILIBRIUM PROPERTIES; NASH EQUILIBRIUM; NETWORK FORMATION; OPTIMUM SOLUTION; POLYNOMIAL-TIME; PRICE OF STABILITY;

POLYNOMIAL APPROXIMATION;

GAME THEORY;

EID: 70350413300     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04128-0_21     Document Type: Conference Paper

References (21)

1. Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, É., Wexler, T., Roughgarden, T.: The Price of Stability for Network Design with Fair Cost Allocation. SIAM Journal on Computing 38(4), 1602-1623 (2008)
2. Anshelevich, E., Dasgupta, A., Tardos, É., Wexler, T.: Near-Optimal Network Design with Selfish Agents. Theory of Computing 4, 77-109 (2008)
3. Anshelevich, E., Karagiozova, A.: Terminal Backup, 3D Matching, and Covering Cubic Graphs. In: Proc. 39th ACM Symposium on Theory of Computing (2007)
4. Chekuri, C., Chuzhoy, J., Lewin-Eytan, L., Naor, J., Orda, A.: Non-cooperative multicast and facility location games. In: Proceedings of the 7th ACM Conference on Electronic Commerce (EC), Ann Arbor, Michigan, pp. 72-81 (2006)
5. Chen, H., Roughgarden, T.: Network Design with Weighted Players. In: SPAA 2006 (2006)
6. Chen, H., Roughgarden, T., Valiant, G.: Designing Networks with Good Equilibria. In: SODA 2008 (2008)
7. Christodoulou, G., Koutsoupias, E.: On the price of anarchy and stability of correlated equilibria of linear congestion games. In: Brodal, G.S., Leonardi, S. (eds.)ESA 2005. LNCS, vol. 3669, pp. 59-70. Springer, Heidelberg (2005)
8. Epstein, A., Feldman, M., Mansour, Y.: Strong Equilibrium in Cost-Sharing Connection Games. In: EC 2007 (2007)
9. Fiat, A., Kaplan, H., Levy, M., Olonetsky, S., Shabo, R.: On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations. In: Bugliesi, M.,Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp.608-618. Springer, Heidelberg (2006)
10. Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. In: SODA 2000 (2000)
11. Goemans, M., Williamson, D.: A General Approximation Technique for Constrained Forest Problems. SIAM Journal on Computing 24, 296-317 (1995)
12. Hoefer, M.: Non-cooperative Facility Location and Covering Games. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 369-378. Springer, Heidelberg (2006)
13. Hoefer, M.: Non-cooperative Tree Creation. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 517-527. Springer, Heidelberg (2006)
14. Hoefer, M., Krysta, P.: Geometric Network Design with Selfish Agents. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 167-178. Springer, Heidelberg (2005)
15. Holzman, R., Law-Yone, N.: Strong Equilibrium in congestion games. Games and Economic Behavior 21 (1997)
16. Jackson, M.: A survey of models of network formation: stability and efficiency. In: Demange, G., Wooders, M. (eds.) Group Formation in Economics: Networks,Clubs and Coalitions. Cambridge Univ. Press, Cambridge
17. Monderer, D., Shapley, L.: Potential Games. Games and Economic Behavior 14, 124-143 (1996)
18. Nisan, N., Roughgarden, T., Tardos, É., Vazirani, V.V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge
19. Rosenthal, R.W.: The network equilibrium problem in integers. Networks 3, 53-59 (1973)
20. Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge
21. Xu, D., Anshelevich, E., Chiang, M.: On Survivable Access Network Design: Complexity and Algorithms. In: INFOCOM 2008 (2008)