Internet and Network Economics

Volume 6484 of the series Lecture Notes in Computer Science pp 194-208

Braess’s Paradox in Large Sparse Graphs

  • Fan ChungAffiliated withDepartment of Mathematics, University of California
  • , Stephen J. YoungAffiliated withDepartment of Mathematics, University of California

* Final gross prices may vary according to local VAT.

Get Access


Braess’s paradox, in its original context, is the counter-intuitive 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.


Braess’s paradox price of anarchy random graphs selfish routing