Braess’s Paradox for Flows over Time

We study the properties of Braess's paradox in the context of the model of congestion games with flow over time introduced by Koch and Skutella. We compare them to the well known properties of Braess's paradox for Wardrop's model of games with static flows. We show that there are networks which do not admit Braess's paradox in Wardrop's model, but which admit it in the model with flow over time. Moreover, there is a topology that admits a much more severe Braess's ratio for this model. Further, despite its symmetry for games with static flow, we show that Braess's paradox is not symmetric for flows over time. We illustrate that there are network topologies which exhibit Braess's paradox, but for which the transpose does not. Finally, we conjecture a necessary and sufficient condition of existence of Braess's paradox in a network, and prove the condition of existence of the paradox either in the network or in its transpose.

[1]  J G Wardrop,et al.  CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[2]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[3]  D. R. Fulkerson,et al.  Constructing Maximal Dynamic Flows from Static Flows , 1958 .

[4]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[5]  R. Duffin.  Topology of series-parallel networks , 1965 .

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

[7]  W. Vickrey.  Congestion Theory and Transport Investment , 1969 .

[8]  Samuel Yagar.  Dynamic traffic assignment by individual path minimization and queuing , 1971 .

[9]  Alain Haurie,et al.  On the relationship between Nash - Cournot and Wardrop equilibria , 1983, Networks.

[10]  Athanasios K. Ziliaskopoulos,et al.  Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future , 2001 .

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

[12]  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.

[13]  Takashi Akamatsu,et al.  Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks , 2003, Transp. Sci..

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

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

[16]  Tim Roughgarden,et al.  Selfish routing and the price of anarchy , 2005 .

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

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

[19]  Ronald Koch,et al.  Nash Equilibria and the Price of Anarchy for Flows over Time , 2010, Theory of Computing Systems.