Nash Equilibria and the Price of Anarchy for Flows over Time

We study Nash equilibria in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows over time (also called dynamic flows), flow travels through a network over time and, as a consequence, flow values on edges are time-dependent. This more realistic setting has not been tackled from the viewpoint of algorithmic game theory yet; but there is a rich literature on game theoretic aspects of flows over time in the traffic community. We present a novel characterization of Nash equilibria for flows over time. It turns out that Nash flows over time can be seen as a concatenation of special static flows. The underlying flow over time model is the so-called deterministic queuing model that is very popular in road traffic simulation and related fields. Based upon this, we prove the first known results on the price of anarchy for flows over time.

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

[2]  H. Chen,et al.  Dynamic Travel Choice Models: A Variational Inequality Approach , 1998 .

[3]  Martin Skutella,et al.  An Introduction to Network Flows over Time , 2008, Bonn Workshop of Combinatorial Optimization.

[4]  Michael J. Smith,et al.  The Existence of a Time-Dependent Equilibrium Distribution of Arrivals at a Single Bottleneck , 1984, Transp. Sci..

[5]  W. Y. Szeto,et al.  A CELL-BASED SIMULTANEOUS ROUTE AND DEPARTURE TIME CHOICE MODEL WITH ELASTIC DEMAND , 2004 .

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

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

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

[9]  Gerhard J. Woeginger,et al.  Minimum-cost dynamic flows: The series-parallel case , 2004, Networks.

[10]  Che-Fu Hsueh,et al.  A model and an algorithm for the dynamic user-optimal route choice problem , 1998 .

[11]  Terry L. Friesz,et al.  A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem , 1993, Oper. Res..

[12]  Bin Ran,et al.  A link-based variational inequality model for dynamic departure time/route choice , 1996 .

[13]  Ana L. C. Bazzan,et al.  Multi-Agent Systems for Traffic and Transportation Engineering , 2009 .

[14]  Bin Ran,et al.  A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models , 1993, Oper. Res..

[15]  Malachy Carey.  Link Travel Times I: Desirable Properties , 2004 .

[16]  Nicholas B. Taylor.  The CONTRAM Dynamic Traffic Assignment Model , 2003 .

[17]  Michel Bierlaire,et al.  DynaMIT: a simulation-based system for traffic prediction and guidance generation , 1998 .

[18]  Richard Mounce.  Convergence to Equilibrium in Dynamic Traffic Networks when Route Cost Is Decay Monotone , 2007, Transp. Sci..

[19]  Mike Smith,et al.  A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks , 1993 .

[20]  Satish V. Ukkusuri,et al.  Equilibria in Dynamic Selfish Routing , 2009, SAGT.

[21]  Kay W. Axhausen,et al.  Agent-Based Demand-Modeling Framework for Large-Scale Microsimulations , 2006 .

[22]  Terry L. Friesz,et al.  Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem , 1989, Oper. Res..

[23]  Martin Skutella,et al.  Flows over time with load-dependent transit times , 2002, SODA '02.

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

[25]  Martin Hoefer,et al.  Competitive routing over time , 2009, Theor. Comput. Sci..

[26]  Takashi Akamatsu,et al.  A DYNAMIC TRAFFIC EQUILIBRIUM ASSIGNMENT PARADOX , 2000 .

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

[28]  Konrad Meister,et al.  MATSim-T: Architektur und Rechenzeiten , 2008 .

[29]  Chris Hendrickson,et al.  Schedule Delay and Departure Time Decisions in a Deterministic Model , 1981 .

[30]  Balázs Kotnyek,et al.  An annotated overview of dynamic network flows , 2003 .

[31]  Michael Florian,et al.  The continuous dynamic network loading problem : A mathematical formulation and solution method , 1998 .

[32]  Hani S. Mahmassani,et al.  System Optimal Dynamic Assignment for Electronic Route Guidance in a Congested Traffic Network: Dynamic Flow Modelling and Control , 1995 .

[33]  Éva Tardos,et al.  “The quickest transshipment problem” , 1995, SODA '95.

[34]  Éva Tardos,et al.  Efficient continuous-time dynamic network flow algorithms , 1998, Oper. Res. Lett..

[35]  H. W. Hamacher,et al.  Mathematical Modelling of Evacuation Problems: A State of Art , 2001 .

[36]  Malachy Carey,et al.  Link Travel Times II: Properties Derived from Traffic-Flow Models , 2004 .

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

[38]  Carlos F. Daganzo,et al.  Queue Spillovers in Transportation Networks with a Route Choice , 1998, Transp. Sci..

[39]  Y. W. Xu,et al.  Advances in the Continuous Dynamic Network Loading Problem , 1996, Transp. Sci..

[40]  Hong Kam Lo,et al.  ARE THE OBJECTIVE AND SOLUTIONS OF DYNAMIC USER-EQUILIBRIUM MODELS ALWAYS CONSISTENT? , 1996 .

[41]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

[42]  Warren B. Powell,et al.  Stochastic and dynamic networks and routing , 1995 .

[43]  Bruce N Janson,et al.  Dynamic traffic assignment for urban road networks , 1991 .

[44]  Benjamin Heydecker,et al.  Consistent Objectives and Solution of Dynamic User Equilibrium Models , 2006 .

[45]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[46]  Jay E. Aronson,et al.  A survey of dynamic network flows , 1989 .

[47]  Bruce Hoppe,et al.  Efficient Dynamic Network Flow Algorithms , 1995 .

[48]  Bin Ran,et al.  MODELING DYNAMIC TRANSPORTATION NETWORKS , 1996 .

[49]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[50]  Hani S. Mahmassani,et al.  Dynamic User Equilibrium Departure Time and Route Choice on Idealized Traffic Arterials , 1984, Transp. Sci..

[51]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[52]  R. Mounce.  Convergence in a continuous dynamic queueing model for traffic networks , 2006 .

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

[54]  Anthony Chen,et al.  A DYNAMIC TRAFFIC ASSIGNMENT MODEL WITH TRAFFIC-FLOW RELATIONSHIPS , 1995 .

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

[56]  M. Ben-Akiva,et al.  STOCHASTIC EQUILIBRIUM MODEL OF PEAK PERIOD TRAFFIC CONGESTION , 1983 .

[57]  P Gower,et al.  CONTRAM, STRUCTURE OF THE MODEL , 1989 .

[58]  Martin Skutella,et al.  Quickest Flows Over Time , 2007, SIAM J. Comput..

[59]  Takashi Akamatsu.  An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues , 2001, Transp. Sci..

[60]  Huey-Kuo Chen,et al.  Dynamic Travel Choice Models , 1999 .