A Stronger Bound on Braess's Paradox

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 333-334

  Lin, Henry ^a   Roughgarden, Tim ^a   Tardos, Éva ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRAESS'S PARADOX; NASH EQUILIBRIUM;

FUNCTIONS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

GRAPH THEORY;

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

References (3)

1. D. Braess. Uber ein paradoxon der verkehrsplanung. Unternehmensforschung, 12:258-268, 1968.
2. M. A. Hall. Properties of the equilibrium state in transportation networks. Transportation Science, 12(3):208-216, 1978.
3. T. Roughgarden. Designing networks for selfish users is hard. In FOCS '01, pages 472-481.