Non-cooperative tree creation

Algorithmica (New York)

Volumn 53, Issue 1, 2009, Pages 104-131

  Hoefer, Martin ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

Approximate Nash equilibrium; Connection game; Network design; Price of anarchy; Steiner tree

Indexed keywords

APPROXIMATE NASH EQUILIBRIUM; CONNECTION GAME; NETWORK DESIGN; PRICE OF ANARCHY; STEINER TREE;

COSTS; GAME THEORY; POLYNOMIAL APPROXIMATION; PORT TERMINALS; TELECOMMUNICATION NETWORKS;

TREES (MATHEMATICS);

EID: 58149489620     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9014-9     Document Type: Article

References (21)

1. A. Agrawal P. Klein R. Ravi 1995 When trees collide: an approximation algorithm for the generalized Steiner problem on networks SIAM J. Comput. 24 3 445 456
2. Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash equilibria for a network creation game. In: Proc. 17th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 89-98 (2006)
3. Anshelevich, E., Dasgupta, A., Tardos, É., Wexler, T.: Near-optimal network design with selfish agents. In: Proc. 35th Ann. ACM Symp. Theo. Comp. (STOC), pp. 511-520 (2003)
4. Anshelevich, E., Dasgupta, A., Kleinberg, J., Roughgarden, T., Tardos, É., Wexler, T.: The price of stability for network design with fair cost allocation. In: Proc. 45th Ann. IEEE Symp. Foundations Comp. Sci. (FOCS), pp. 295-304 (2004)
5. Cardinal, J., Hoefer, M.: Selfish serive installation in networks. In: Proc. 2nd Workshop Internet & Network Economics (WINE) (2006)
6. Chen, H.-L., Roughgarden, T.: Network design with weighted players. In: Proc. 18th Symp. Parallelism in Algorithms and Architectures (SPAA), pp. 29-38 (2006)
7. Corbo, J., Parkes, D.: The price of selfish behavior in bilateral network formation. In: Proc. 24th Ann. ACM Symp. Principles of Distributed Comp. (PODC), pp. 99-107 (2005)
8. Czumaj, A., Krysta, P., Vöcking, B.: Selfish traffic allocation for server farms. In: Proc. 34th Ann. ACM Symp. Theory Comp. (STOC), pp. 287-296 (2002)
9. Demaine, E., Mahini, H., Hajiaghayi, M.T., Zadimoghaddam, M.: The price of anarchy in network creation games. In: Proc. 26th Ann. ACM Symp. Principles of Distributed Comp. (PODC) (2007)
10. S.E. Dreyfus R.A. Wagner 1972 The steiner problem in graphs Networks 1 195 207
11. Fabrikant, A., Luthera, A., Maneva, E., Papadimitriou, C., Shenker, S.: On a network creation game. In: Proc. 22nd Ann. ACM Symp. Principles of Distributed Comp. (PODC), pp. 347-351 (2003)
12. M. Goemams D. Williamson 1995 A general approximation technique for constrained forest problems SIAM J. Comput. 24 2 296 317
13. Hoefer, M.: Non-cooperative facility location and covering games. In: Proc. 17th Int. Symp. Algorithms and Computation (ISAAC 2006) (2006)
14. Hoefer, M.: Non-cooperative tree creation. In: Proc. 31st Symp. Math. Foundations of Comp. Sci. (MFCS), pp. 517-527 (2006)
15. Hoefer, M., Krysta, P.: Geometric network design with selfish agents. In: Proc. 11th Conf. on Comp. and Comb. (COCOON), Lecture Notes in Computer Science, vol. 3595, pp. 167-178 (2005)
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 University Press, Cambridge (2004). Chap. 1
17. Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proc. 16th Ann. Symp. Theoretical Aspects Comp. Sci. (STACS), pp. 404-413 (1999)
18. Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proc. 10th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 770-779 (2000)
19. T. Roughgarden É. Tardos 2002 How bad is selfish routing? J. ACM 49 2 236 259
20. A. Schulz N. Stier Moses 2004 Selfish routing in capacitated networks Math. Oper. Res. 29 4 961 976
21. Vetta, A.: Nash equilibria in competitive societies with application to facility location, traffic routing and auctions. In: Proc. 43rd Ann. IEEE Symp. Foundations Comp. Sci. (FOCS), p. 416 (2002)