Braess's Paradox in large random graphs

  • Authors:

  • Gregory Valiant;Tim Roughgarden

  • Affiliations:

  • Computer Science Division, University of California, Berkeley, California 94720;Department of Computer Science, Stanford University, Stanford, California 94305

  • Venue:
  • Random Structures & Algorithms
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Braess's Paradox is the counterintuitive fact that removing edges from a network with “selfish routing” can decreasethe 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. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010 A preliminary version of this article appeared in the Proceedings of the 7th ACM Conference on Electronic Commerce, June 2006.