Braess's paradox in large sparse graphs

Authors:
Fan Chung;Stephen J. Young
Affiliations:
Department of Mathematics, University of California, San Diego, La Jolla, CA;Department of Mathematics, University of California, San Diego, La Jolla, CA
Venue:
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Year:
2010

Citing 7
Cited 1

Algorithms, games, and the internet

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
How bad is selfish routing?

Journal of the ACM (JACM)
A stronger bound on Braess's Paradox

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time

Journal of the ACM (JACM)
On the severity of Braess's paradox: designing networks for selfish users is hard

Journal of Computer and System Sciences - Special issue on FOCS 2001
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Braess's Paradox in large random graphs

Random Structures & Algorithms

Braess's paradox in expanders

Random Structures & Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Braess's paradox, in its original context, is the counterintuitive 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.