On a Network Creation Game

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 347-351

  Fabrikant, Alex ^a   Luthra, Ankur ^a   Maneva, Elitza ^a   Papadimitriou, Christos H ^a   Shenker, Scott ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

Distributed network design; Game theoretic models; Nash equilibria; Price of anarchy

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); GAME THEORY; GRAPH THEORY; QUALITY OF SERVICE; TELECOMMUNICATION LINKS; TOPOLOGY;

DISTRIBUTED NETWORK DESIGN; NASH EQUILIBRIA; PRICE OF ANARCHY;

INTERNET;

EID: 1142293089     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/872035.872088     Document Type: Conference Paper

References (7)

1. A. Czumaj, P. Krysta, and B. Vöcking. Selfish traffic allocation for server farms. In Proc. of 2002 STOC, pages 287-296. ACM, May 2002.
2. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In Proc. of 1999 SIGCOMM, pages 251-262. ACM, September 1999.
3. J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker. A bgp-based mechanism for lowest-cost routing, In Proc. of 2002 PODC, pages 173-182. ACM, July 2002.
4. E. Koutsoupias and C. H. Papadimitriou. Worst-case equilibria. Lecture Notes in Computer Science, 1563:404-413, 1999.
5. M. Mavronikolas and P. Spirakis. The price of selfish routing. In Proc. of 2001 STOC, pages 510-519. ACM, July 2001.
6. T. Roughgarden. Selfish Routing. PhD thesis, Cornell University, 2002.
7. T. Roughgarden and E. Tardos. How bad is selfish routing? In Proc. of 2000 FOCS, pages 93-102. IEEE, November 2000.