Braess’s Paradox in Large Sparse Graphs
Braess’s paradox, in its original context, is the counter-intuitive observation that, without lessening demand, closing roads can improve traffic flow. With the explosion of distributed (selfish) routing situations understanding this paradox has become an important concern in a broad range of network design situations. However, the previous theoretical work on Braess’s paradox has focused on “designer” graphs or dense graphs, which are unrealistic in practical situations. In this work, we exploit the expansion properties of Erdős-Rényi random graphs to show that Braess’s paradox occurs when np ≥ c log(n) for some c > 1.
KeywordsBraess’s paradox price of anarchy random graphs selfish routing
Unable to display preview. Download preview PDF.
- 1.Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the economics of transportation. Yale University Press, London (1956)Google Scholar
- 5.Kameda, H.: How harmful the paradox can be in the braess/cohen-kelly-jeffries networks. In: Proceedings of IEEE Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2002, vol. 1, pp. 437–445 (2002)Google Scholar
- 6.Klee, V., Minty, G.J.: How good is the simplex algorithm? In: Inequalities, III (Proc. Third Sympos., Univ. California, Los Angeles, Calif. (1969); dedicated to the memory of Theodore S. Motzkin), pp. 159–175. Academic Press, New York (1972) Google Scholar
- 7.Kolata, G.: What if they closed 42d street and nobody noticed? The New York Times (December 25, 1990)Google Scholar
- 9.Lin, H., Roughgarden, T., Tardos, É.: A stronger bound on Braess’s paradox. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (electronic), pp. 340–341. ACM, New York (2004)Google Scholar
- 10.Papadimitriou, C.: Algorithms, games, and the internet. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing (electronic), pp. 749–753. ACM, New York (2001)Google Scholar
- 12.Penchina, C.M.: Braess paradox: Maximum penalty in a minimal critical network. Transportation Research Part A: Policy and Practice 31(5), 379–388 (1997)Google Scholar
- 16.Valiant, G., Roughgarden, T.: Braess’s paradox in large random graphs. Random Structures Algorithms (to appear)Google Scholar
- 17.Wardrop, J.: Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers, Part II 1(36), 352–362 (1952)Google Scholar