The following publications are possibly variants of this publication:
- Braess s Paradox, Fibonacci Numbers, and Exponential InapproximabilityHenry Lin, Tim Roughgarden, Éva Tardos, Asher Walkover. icalp 2005: 497-512 [doi]
- Braess s paradox in large random graphsGregory Valiant, Tim Roughgarden. sigecom 2006: 296-305 [doi]
- Braess s Paradox in large random graphsGregory Valiant, Tim Roughgarden. rsa, 37(4):495-515, 2010. [doi]
- Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish RoutingHenry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover. siamdm, 25(4):1667-1686, 2011. [doi]
- On the severity of Braess s Paradox: Designing networks for selfish users is hardTim Roughgarden. jcss, 72(5):922-953, 2006. [doi]