Geometric network design with selfish agents

Lecture Notes in Computer Science

Volumn 3595, Issue , 2005, Pages 167-178

  Hoefer, Martin ^a   Krysta, Piotr ^b  

^a UNIVERSITY OF KONSTANZ   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GAME THEORY; ARTIFICIAL INTELLIGENCE; COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; COSTS; SALES; TELECOMMUNICATION NETWORKS;

GEOMERTRIC NETWORK DESIGN; GEOMETRIC GAMES; NASH EQUILIBRIUM; SELFISH AGENTS; GEOMETRIC NETWORK DESIGN; NASH EQUILIBRIA; NONCOOPERATIVE NETWORKS; OPTIMUM NETWORKS; OPTIMUM SOLUTION; PAYMENT SCHEMES; PRICE OF ANARCHY;

TELECOMMUNICATION NETWORKS; GEOMETRY;

EID: 26844575929     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11533719_19     Document Type: Conference Paper

References (17)

1. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden. The price of stability for network design with fair cost allocation. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 295-304, 2004.
2. E. Anshelevich, A. Dasgupta, É. Tardos, and T. Wexler. Near-optimal network design with selfish agents. In Proceedings of the 35th Annual Symposium on Theory of Computing (STOC), pages 511-520, 2003.
3. S. Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM, 45(5):753-782, 1998.
4. V. Bala and S. Goyal. A non-cooperative model of network formation. Econometrica, 68:1181-1229, 2000.
5. M. Chlebík and J. Chlebíková. Approximation hardness of the Steiner tree problem in graphs. In Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (SWAT), pages 170-179, 2002.
6. A. Czumaj, P. Krysta, and B. Vöcking. Selfish traffic allocation for server farms. In Proceedings of the 34th Annual ACM Symposium on the Theory of Computing (STOC), pages 287-296, 2002.
7. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry - Algorithms and Applications. Springer Verlag, 1997.
8. D. Dutta, A. Goel, and J. Heidemann. Oblivious AQM and Nash equilibrium. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2003.
9. A. Fabrikant, A. Luthera, E. Maneva, C. Papadimitriou, and S. Shenker. On a network creation game. In Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 347-351, 2003.
10. E. Gilbert and H. Pollak. Steiner Minimal Trees. SIAM Journal on Applied Mathematics, 16:1-29, 1968.
11. M. Goemams and D. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24(2):296-317, 1995.
12. H. Heller and S. Sarangi. Nash networks with heterogeneous agents. Technical Report Working Paper Series, E-2001-1, Virginia Tech, 2001.
13. E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pages 404-413, 1999.
14. Z. Melzak. On the problem of Steiner. Canadian Mathematical Bulletin, 4:143-148, 1961.
15. G. Robins and A. Zelikovsky. Improved Steiner tree approximation in graphs. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 770-779, 2000.
16. T. Roughgarden and É.Tardos. How bad is selfish routing? Journal of the ACM, 49(2):236-259, 2002.
17. A. Schulz and N. Stier Moses. Selfish routing in capacitated networks. Mathematics of Operations Research, 29(4):961-976, 2004.