Dynamics of a 2D Piecewise Linear Braess Paradox Model: Effect of the Third Partition

In this work, we investigate the dynamics of a piecewise linear 2D discontinuous map modeling a simple network showing the Braess paradox. This paradox represents an example in which adding a new route to a specific congested transportation network makes all the travelers worse off in terms of their individual travel time. In the particular case in which the modeled network corresponds to a binary choice situation, the map is defined on two partitions and its dynamics has already been described. In the general case corresponding to a ternary choice, a third partition appears leading to significantly more complex bifurcation structures formed by border collision bifurcations of stable cycles with points located in all three partitions. Considering a map taking a constant value on one of the partitions, we provide a first systematic description of possible dynamics for this case.

[1]  Bing-Hong Wang,et al.  Braess's Paradox in Epidemic Game: Better Condition Results in Less Payoff , 2013, Scientific Reports.

[2]  Laura Gardini,et al.  Codimension-2 Border Collision, Bifurcations in One-Dimensional, Discontinuous Piecewise Smooth Maps , 2014, Int. J. Bifurc. Chaos.

[3]  Anna Nagurney,et al.  Preface to "On a Paradox of Traffic Planning" , 2005, Transp. Sci..

[4]  Laura Gardini,et al.  Impulsivity in Binary Choices and the Emergence of Periodicity , 2009 .

[5]  Michael Schanz,et al.  Calculation of bifurcation Curves by Map Replacement , 2010, Int. J. Bifurc. Chaos.

[6]  Ugo Merlone,et al.  Dynamics in Braess Paradox with Nonimpulsive Commuters , 2015 .

[7]  Michael A. Zaks,et al.  Universal scenarios of transitions to chaos via homoclinic bifurcations , 1989 .

[8]  J. Keener.  Chaotic behavior in piecewise continuous difference equations , 1980 .

[9]  Ugo Merlone,et al.  Border-collision bifurcations in a model of Braess paradox , 2013, Math. Comput. Simul..

[10]  Amnon Rapoport,et al.  Navigating congested networks with variable demand: Experimental evidence , 2006 .

[11]  William H. Sandholm,et al.  Population Games And Evolutionary Dynamics , 2010, Economic learning and social evolution.

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

[13]  Michael Schanz,et al.  Border-Collision bifurcations in 1D Piecewise-Linear Maps and Leonov's Approach , 2010, Int. J. Bifurc. Chaos.

[14]  Laura Gardini,et al.  Ternary choices in repeated games and border collision bifurcations , 2012 .

[15]  Tim Roughgarden,et al.  Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing , 2011, SIAM J. Discret. Math..

[16]  Laura Gardini,et al.  Periodic Cycles and Bifurcation Curves for One-Dimensional Maps with Two Discontinuities , 2009 .

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

[18]  Ale Jan Homburg,et al.  Some global aspects of homoclinic bifurcations of vector fields , 1996 .

[19]  Eitan Altman,et al.  A Braess type paradox in power control over interference channels , 2008, WiOpt 2008.

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

[21]  Iryna Sushko,et al.  Bifurcation Structures in a Bimodal Piecewise Linear Map: Chaotic Dynamics , 2015, Int. J. Bifurc. Chaos.

[22]  Ana L. C. Bazzan,et al.  Case Studies on the Braess Paradox: Simulating Route Recommendation and Learning in Abstract and Microscopic Models , 2005 .

[23]  Eyran J. Gisches,et al.  Degrading network capacity may improve performance: private versus public monitoring in the Braess Paradox , 2012 .