Braess's Paradox in large random graphs

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.

[1]  A. Nagurney,et al.  ON SOME TRAFFIC EQUILIBRIUM THEORY PARADOXES , 1984 .

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

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

[4]  Eitan Altman,et al.  Properties of equilibria in competitive routing with several user types , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

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

[6]  Stella C. Dafermos,et al.  Traffic assignment problem for a general network , 1969 .

[7]  Richard Steinberg,et al.  PREVALENCE OF BRAESS' PARADOX , 1983 .

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

[9]  Azuma Taguchi.  BRAESS' PARADOX IN A TWO-TERMINAL TRANSPORTATION NETWORK , 1982 .

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

[11]  Eitan Altman,et al.  Avoiding paradoxes in multi-agent competitive routing , 2003, Comput. Networks.

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

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

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

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

[16]  Ariel Orda,et al.  Capacity allocation under noncooperative routing , 1997, IEEE Trans. Autom. Control..

[17]  J. D. Murchland,et al.  Braess's paradox of traffic flow , 1970 .

[18]  Ariel Orda,et al.  The designer's perspective to atomic noncooperative networks , 1999, TNET.

[19]  B. Bollobás.  The evolution of random graphs , 1984 .

[20]  Ariel Orda,et al.  Avoiding the Braess paradox in non-cooperative networks , 1999, Journal of Applied Probability.