Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks

References

• Anderson EJ, Philpott AB (1994) Optimisation of flows in networks over time. Kelly FP, ed. Probability, Statistics and Optimisation (Wiley, New York), 369–382.Google Scholar
• Cao Z, Chen B, Chen X, Wang C (2017) A network game of dynamic traffic. EC 2017: Proc. 2017 ACM Conf. on Economics and Computation (ACM, New York), 695–696.Google Scholar
• Cominetti R, Correa J, Larré O (2015) Dynamic equilibria in fluid queueing networks. Oper. Res. 63(1):21–34.Link, Google Scholar
• Fleischer L, Tardos E (1998) Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23(3-5):71–80.Crossref, Google Scholar
• Ford LR, Fulkerson DR (1958) Constructing maximal dynamic flows from static flows. Oper. Res. 6(3):419–433.Link, Google Scholar
• Ford LR, Fulkerson DR (1962) Flows in Networks (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Friesz TL, Han K (2018) The mathematical foundations of dynamic user equilibrium. Transportation Res. Part B: Methodological 126:309–328.Google Scholar
• Friesz TL, Bernstein D, Smith TE, Tobin RL, Wie BW (1993) A variational inequality formulation of the dynamic network user equilibrium problem. Oper. Res. 41(1):179–191.Link, Google Scholar
• Gale D (1959) Transient flows in networks. Michigan Math. J. 6(1):59–63.Crossref, Google Scholar
• Graf L, Harks T, Sering L (2020) Dynamic flows with adaptive route choice. Math. Program. 183:309–335.Google Scholar
• Koch R (2012) Routing games over time. Unpublished doctoral thesis, TU-Berlin.Google Scholar
• Koch R, Skutella M (2011) Nash equilibria and the price of anarchy for flows over time. Theory Comput. Systems 49:71–97.Crossref, Google Scholar
• Merchant DK, Nemhauser GL (1978a) A model and an algorithm for the dynamic traffic assignment problems. Transportation Sci. 12:183–199.Link, Google Scholar
• Merchant DK, Nemhauser GL (1978b) Optimality conditions for a dynamic traffic assignment model. Transportation Sci. 12(3):200–207.Link, Google Scholar
• Meunier F, Wagner N (2010) Equilibrium results for dynamic congestion games. Transportation Sci. 44(4):524–536.Link, Google Scholar
• Peeta S, Ziliaskopoulos AK (2001) Foundations of dynamic traffic assignment: The past, the present and the future. Networks Spatial Econom. 1(3-4):233–265.Crossref, Google Scholar
• Ran B, Boyce D (1996) Modeling Dynamic Transportation Networks (Springer, Berlin).Crossref, Google Scholar
• Sering L, Skutella M (2018) Multi-source Multi-sink Nash Flows over Time. Bornd R, Storandt S, eds. ATMOS, Proc. 18th Workshop Algorithmic Approaches Transportation Model., Optim., Systems (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany), 12(1):12–20.Google Scholar
• Sering L, Vargas Koch L (2019) Nash Flows over Time with Spillback SODA, Proc. 30th Annual ACM-SIAM Sympos. Discrete Algorithms (ACM, New York), 935–945.Crossref, Google Scholar
• Skutella M (2009) An introduction to network flows over time. Cook W, Lovasz L, Vygen J, eds. Research Trends in Combinatorial Optimization (Springer, Berlin), 451–482.Crossref, Google Scholar
• Vickrey WS (1969) Congestion theory and transport investment. Amer. Econom. Rev. 59(2):251–260.Google Scholar
• Wagner N (2012) The dynamic user equilibrium on a transport network: mathematical properties and economic applications. Unpublished doctoral thesis, Université Paris-Est.Google Scholar
• Xu YW, Wu JH, Florian M, Marcotte P, Zhu DL (1999) Advances in the continuous dynamic network loading problem. Transportation Sci. 33(4):341–353.Link, Google Scholar
• Zhu D, Marcotte P (2000) On the existence of solutions to the dynamic user equilibrium problem. Transportation Sci. 34(4):402–414.Link, Google Scholar