Braess's paradox in expanders

Expander graphs are known to facilitate effective routing and most real-world networks have expansion properties. At the other extreme, it has been shown that in some special graphs, removing certain edges can lead to moreefficient routing. This phenomenon is known as Braess's paradox and is usually regarded as a rare event. In contrast to what one might expect, we show that Braess's paradox is ubiquitous in expander graphs. Specifically, we prove that Braess's paradox occurs in a large class of expander graphs with continuous convex latency functions. Our results extend previous work which held only when the graph was both denser and random and for random linear latency functions. We identify deterministic sufficient conditions for a graph with as few as a linear number of edges, such that Braess's Paradox almost always occurs, with respect to a general family of random latency functions. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012 © 2012 Wiley Periodicals, Inc.

[1]  Tim Roughgarden,et al.  On the severity of Braess's Paradox: Designing networks for selfish users is hard , 2006, J. Comput. Syst. Sci..

[2]  B. Monien,et al.  Sixth annual symposium on Theoretical aspects of computer science , 1990 .

[3]  Tim Roughgarden,et al.  A stronger bound on Braess's Paradox , 2004, SODA '04.

[4]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[5]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[6]  Dietrich Braess,et al.  Über ein Paradoxon aus der Verkehrsplanung , 1968, Unternehmensforschung.

[7]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[8]  Ronitt Rubinfeld,et al.  Short paths in expander graphs , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[9]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[10]  Christos Gkantsidis,et al.  Conductance and congestion in power law graphs , 2003, SIGMETRICS '03.

[11]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[12]  Christos H. Papadimitriou,et al.  Algorithms, Games, and the Internet , 2001, ICALP.

[13]  Amin Saberi,et al.  On certain connectivity properties of the internet topology , 2006, J. Comput. Syst. Sci..

[14]  Claude M. Penchina.  Braess paradox: Maximum penalty in a minimal critical network , 1997 .

[15]  Anna Nagurney,et al.  On a Paradox of Traffic Planning , 2005, Transp. Sci..

[16]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[17]  M. A. Hall,et al.  Properties of the Equilibrium State in Transportation Networks , 1978 .

[18]  Christos H. Papadimitriou,et al.  Algorithms, games, and the internet , 2001, STOC '01.

[19]  Alan M. Frieze.  Edge-disjoint paths in expander graphs , 2000, SODA '00.

[20]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

[21]  Marguerite FRANK,et al.  The Braess paradox , 1981, Math. Program..

[22]  Fan Chung Graham,et al.  Braess's Paradox in Large Sparse Graphs , 2010, WINE.

[23]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[24]  I. Milchtaich.  Network Topology and the Efficiency of Equilibrium , 2005 .

[25]  Jerrold W. Grossman,et al.  A portion of the well-known collaboration graph , 1995 .

[26]  J. Hiriart-Urruty,et al.  Fundamentals of Convex Analysis , 2004 .

[27]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[28]  S. Pallottino,et al.  Empirical evidence for equilibrium paradoxes with implications for optimal planning strategies , 1981 .

[29]  Alexander Lubotzky,et al.  Expander graphs in pure and applied mathematics , 2011, 1105.2389.

[30]  N. Alon,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2004 .

[31]  Tim Roughgarden,et al.  Braess's Paradox in large random graphs , 2010 .

[32]  Igal Milchtaich,et al.  Network Topology and the Efficiency of Equilibrium , 2005, Games Econ. Behav..

[33]  Hisao Kameda,et al.  How harmful the paradox can be in the Braess/Cohen-Kelly-Jeffries networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[34]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[35]  Eric I. Pas,et al.  Braess' paradox: Some new insights , 1997 .

[36]  Paul G. Spirakis,et al.  Efficient methods for selfish network design , 2009, Theor. Comput. Sci..