Braess's Paradox in large random graphs

Random Structures and Algorithms

Volumn 37, Issue 4, 2010, Pages 495-515

  Valiant, Gregory ^a   Roughgarden, Tim ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Stanford University   (United States)

Author keywords

Braess's Paradox; Random graphs; Selfish routing; Traffic equilibria

Indexed keywords

EID: 77958585725     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20325     Document Type: Article

References (32)

1. E.Altman, R.El Azouzi, and O.Pourtallier, Avoiding paradoxes in multi-agent competitive routing, Comput Networks 43( 2003), 133-146.
2. M.Beckmann, C. B.McGuire, and C. B.Winsten, Studies in the economics of transportation, Yale University Press, New Haven, CT, 1956.
3. D. P.Bertsekas, and J. N.Tsitsiklis, Parallel and distributed computation: Numerical methods, 2nd edition, Prentice-Hall, Upper Saddle River, NJ, 1989; Athena Scientific, Belmont, MA, 1997.
4. B.Bollobás, Random graphs, Academic Press, London, 1985.
5. D.Braess, Über ein Paradoxon aus der Verkehrsplanung, Unternehmensforschung 12( 1968), 258-268. English translation in Ref. [6].
6. D.Braess, On a paradox of traffic planning, Transport Sci 39( 2005), 446-450.
7. S. C.Dafermos, and A.Nagurney, On some traffic equilibrium theory paradoxes, Transport Res B 18( 1984), 101-110.
8. S. C.Dafermos, and F. T.Sparrow, The traffic assignment problem for a general network, J Res Nat Bur Stand, B 73( 1969), 91-118.
9. R.El Azouzi, E.Altman, and O.Pourtallier, Properties of equilibria in competitive routing with several user types, In Proceedings of the 41st IEEE Conference on Decision and Control, Vol. 4, Las Vegas, NV, 2002, pp. 3646-3651.
10. P.Erdös, and A.Rényi, On the evolution of random graphs, Publ Math Inst Hungar Acad Sci 5( 1960), 17-61.
11. C.Fisk, and S.Pallottino, Empirical evidence for equilibrium paradoxes with implications for optimal planning strategies, Transport Res A 15( 1981), 245-248.
12. M.Frank, The Braess Paradox, Math Program 20( 1981), 283-302.
13. M.Frank, Cost-deceptive links on ladder networks, Meth Oper Res 45( 1983), 75-86.
14. E. J.Friedman, Genericity and congestion control in selfish routing, In Proceedings of the 43rd Annual IEEE Conference on Decision and Control, Paradise Island, Bahamas, 2004, pp. 4667-4672.
15. M. A.Hall, Properties of the equilibrium state in transportation networks, Transport Sci 12( 1978), 208-216.
16. H.Kameda, How harmful the paradox can be in the Braess/Cohen-Kelly-Jeffries networks, In Proceedings of the 21st INFOCOM Conference, Vol. 1, 2002, pp. 437-445.
17. G.Kolata, What if they closed 42nd Street and nobody noticed? New York Times, December 25, 1990, p. 38.
18. Y. A.Korilis, A. A.Lazar, and A.Orda, Capacity allocation under noncooperative routing, IEEE Trans Automat Contr 42( 1997), 309-325.
19. Y. A.Korilis, A. A.Lazar, and A.Orda, Avoiding the Braess paradox in noncooperative networks, J Appl Probab 36( 1999), 211-222.
20. L.Libman, and A.Orda, The designer's perspective to atomic noncooperative networks, IEEE/ACM Trans Networking 7( 1999), 875-884.
21. H.Lin, T.Roughgarden, and É.Tardos, A stronger bound on Braess's Paradox, In Proceedings of the 15th Annual Symposium on Discrete Algorithms, New Orleans, LA, 2004, pp. 333-334.
22. H.Lin, T.Roughgarden, É.Tardos, and A.Walkover, Braess's Paradox, Fibonacci numbers, and exponential inapproximability, In Proceedings of the 32nd Annual International Colloquium on Automata, Languages, and Programming (ICALP), Vol. 3580, Lecture Notes in Computer Science, 2005, pp. 497-512.
23. R.Motwani, and P.Raghavan, Randomized algorithms, Cambridge University Press, New York, NY, 1995.
24. J. D.Murchland, Braess's paradox of traffic flow, Transport Res 4( 1970), 391-394.
25. E. I.Pas, and S. L.Principio, Braess'paradox: Some new insights, Transport Res B 31( 1997), 265-276.
26. C. M.Penchina, Braess paradox: Maximum penalty in a minimal critical network, Transport Res A 31( 1997), 379-388.
27. T.Roughgarden, Selfish routing and the price of anarchy, MIT Press, Cambridge, MA, 2005.
28. T.Roughgarden, On the severity of Braess's Paradox: Designing networks for selfish users is hard., J Comput Syst Sci 72( 2006), 922-953.
29. T.Roughgarden, and É.Tardos, How bad is selfish routing? J ACM 49( 2002), 236-259.
30. R.Steinberg, and W. I.Zangwill, The prevalence of Braess'Paradox, Transport Sci 17( 1983), 301-318.
31. A.Taguchi, Braess'paradox in a two-terminal transportation network, J Oper Res Soc Japan 25( 1982), 376-388.
32. J. G.Wardrop, Some theoretical aspects of road traffic research, In Proceedings of the Institute of Civil Engineers, Part II, Vol. 1, London, 1952, pp. 325-378.