The designer's perspective to atomic noncooperative networks
IEEE/ACM Transactions on Networking (TON)
Journal of the ACM (JACM)
Parallel and Distributed Computation: Numerical Methods
Parallel and Distributed Computation: Numerical Methods
Sharing the cost of multicast transmissions
Journal of Computer and System Sciences - Special issue on Internet algorithms
Designing Networks for Selfish Users is Hard
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A stronger bound on Braess's Paradox
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
On a Paradox of Traffic Planning
Transportation Science
Braess's paradox, fibonacci numbers, and exponential inapproximability
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The Network Game: Analyzing Network-Formation and Interaction Strategies in Tandem
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Efficient Methods for Selfish Network Design
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Myopic distributed protocols for singleton and independent-resource congestion games
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Optimal sub-networks in traffic assignment problem and the Braess paradox
Computers and Industrial Engineering
Selfish splittable flows and NP-completeness
Computer Science Review
Efficient methods for selfish network design
Theoretical Computer Science
| Hi-index | 0.00 |
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.