Braess's paradox in large random graphs

12 years 3 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an equilibrium flow. Despite the large amount of research motivated by Braess’s Paradox since its discovery in 1968, little is known about whether it is a common real-world phenomenon, or a mere theoretical curiosity. In this paper, we show that Braess’s Paradox is likely to occur in a natural random network model. More precisely, with high probability, (as the number of vertices goes to infinity), there is a traffic rate and a set of edges whose removal improves the latency of traffic in an equilibrium flow by a constant factor. Our proof approach is robust and shows that the “global” behavior of an equilibrium flow in a large random network is similar to that in Braess’s original four-node example. Categories and Subject Descriptors F.0 [Theory of Computation]: General General Terms Algorithms, Eco...
Gregory Valiant, Tim Roughgarden
Added 14 Jun 2010
Updated 14 Jun 2010
Type Conference
Year 2006
Authors Gregory Valiant, Tim Roughgarden
Comments (0)