Braess’s Paradox in Large Sparse Graphs

  • Fan Chung
  • Stephen J. Young
Conference paper

DOI: 10.1007/978-3-642-17572-5_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6484)
Cite this paper as:
Chung F., Young S.J. (2010) Braess’s Paradox in Large Sparse Graphs. In: Saberi A. (eds) Internet and Network Economics. WINE 2010. Lecture Notes in Computer Science, vol 6484. Springer, Berlin, Heidelberg

Abstract

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.

Keywords

Braess’s paradox price of anarchy random graphs selfish routing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Fan Chung
    • 1
  • Stephen J. Young
    • 1
  1. 1.Department of MathematicsUniversity of CaliforniaLa Jolla

Personalised recommendations