Journal
RANDOM STRUCTURES & ALGORITHMS
Volume 37, Issue 4, Pages 495-515Publisher
WILEY
DOI: 10.1002/rsa.20325
Keywords
Braess's Paradox; random graphs; selfish routing; traffic equilibria
Funding
- DARPA [W911NF-05-1-0224]
- ONR [N00014-04-1-0725]
- NSF
Ask authors/readers for more resources
Braess's Paradox is the counterintuitive fact that removing edges from a network with selfish routing can decrease the latency incurred by traffic in an equilibrium flow. We prove that Braess's Paradox is likely to occur in a natural random network model: with high probability, 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. (C) 2010 Wiley Periodicals, Inc. Random Struct. Alg., 37, 495-515, 2010
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available