The Maximum Latency of Selfish Routing

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 973-974

  Roughgarden, Tim ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LATENCY FUNCTIONS; MULTICOMMODITY NETWORKS; NASH FLOW; SELFISH ROUTING;

BOUNDARY CONDITIONS; COMPUTER NETWORKS; CONGESTION CONTROL (COMMUNICATION); POLYNOMIALS; PROBLEM SOLVING; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

ROUTERS;

EID: 1842434514     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. T. Roughgarden. Designing networks for selfish users is hard. In FOGS '01, pages 472-481.
2. T. Roughgarden. The price of anarchy is independent of the network topology. In STOC '02, pages 428-437.
3. T. Roughgarden and É, Tardos. How bad is selfish routing? Journal of the ACM, 49(2):236-259, 2002.
4. D. Weitz. The price of anarchy. Unpublished manuscript, 2001.