Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents

References

• Anshelevich E, Ukkusuri S (2009) Equilibria in dynamic selfish routing. Mavronicolas M, Papadopoulou VG, eds. Internat. Sympos. Algorithmic Game Theory (Springer, Berlin, Heidelberg), 171–182.Crossref, Google Scholar
• Bressan A, Han K (2013) Existence of optima and equilibria for traffic flow on networks. Networks Heterogeneous Media 8(3):627–648.Crossref, Google Scholar
• Bressan A, Nguyen KT (2015) Optima and equilibria for traffic flow on networks with backward propagating queues. Networks Heterogeneous Media 10(4):717–748.Crossref, Google Scholar
• Cominetti R, Correa J, Larré O (2015) Dynamic equilibria in fluid queueing networks. Oper. Res. 63(1):21–34.Link, Google Scholar
• Cominetti R, Correa J, Olver N (2017) Long term behavior of dynamic equilibria in fluid queuing networks. Eisenbrand F, Koenemann J, eds. Internat. Conf. Integer Programming Combin. Optim. (Springer, Cham, Switzerland), 161–172.Crossref, Google Scholar
• Correa JR, Stier-Moses NE (2010) Wardrop equilibria. Cochran JJ, Cox LA, Keskinocak P, Kharoufeh JP, Smith JC, eds. Wiley Encyclopedia of Operations Research and Management Science. (Wiley Online Library, Hoboken, New Jersey), 1–12.Google Scholar
• Correa J, de Jong J, De Keijzer B, Uetz M (2019) The inefficiency of Nash and subgame perfect equilibria for network routing. Math. Oper. Res. 44(4):1286–1303.Link, Google Scholar
• Daganzo CF (1998) Queue spillovers in transportation networks with a route choice. Transportation Sci. 32(1):3–11.Link, Google Scholar
• Graf L, Harks T (2019) Dynamic flows with adaptive route choice. Lodi A, Nagarajan V, eds. Internat. Conf. Integer Programming Combin. Optim. (Springer, Cham, Switzerland), 219–232.Crossref, Google Scholar
• Guo R-Y, Yang H, Huang H-J (2018) Are we really solving the dynamic traffic equilibrium problem with a departure time choice? Transportation Sci. 52(3):603–620.Link, Google Scholar
• Hamdouch Y, Marcotte P, Nguyen S (2004) A strategic model for dynamic traffic assignment. Networks Spatial Econom. 4(3):291–315.Crossref, Google Scholar
• Han K, Friesz TL, Yao T (2013) Existence of simultaneous route and departure choice dynamic user equilibrium. Transportation Res. Part B: Methodological 53:17–30.Crossref, Google Scholar
• Harks T, Peis B, Schmand D, Tauer B, Koch LV (2018) Competitive packet routing with priority lists. ACM Trans. Econom. Comput. 6(1):4.Google Scholar
• Hendrickson C, Kocur G (1981) Schedule delay and departure time decisions in a deterministic model. Transportation Sci. 15(1):62–77.Link, Google Scholar
• Hoefer M, Mirrokni VS, Röglin H, Teng S-H (2009) Competitive routing over time. Leonardi S, eds. Internat. Workshop Internet Network Econom. (Springer, Berlin, Heidelberg), 18–29.Crossref, Google Scholar
• Hoefer M, Mirrokni VS, Röglin H, Teng S-H (2011) Competitive routing over time. Theoretical Comput. Sci. 412(39):5420–5432.Crossref, Google Scholar
• Holzman R, Law-Yone N (1997) Strong equilibrium in congestion games. Games Econom. Behav. 21(1–2):85–101.Crossref, Google Scholar
• Ismaili A (2017) Routing games over time with FIFO policy. Devanur NR, Lu P, eds. Web and Internet Economics (Springer, Cham, Switzerland), 266–280.Crossref, Google Scholar
• Koch R (2012) Routing games over time. Unpublished PhD thesis, Technische Universität Berline, Berlin.Google Scholar
• Koch R, Skutella M (2009) Nash equilibria and the price of anarchy for flows over time. Mavronicolas M, Papadopoulou VG, eds. Internat. Sympos. Algorithmic Game Theory (Springer, Berlin, Heidelberg), 323–334.Crossref, Google Scholar
• Koch R, Skutella M (2011) Nash equilibria and the price of anarchy for flows over time. Theory Comput. Systems 49(1):71–97.Crossref, Google Scholar
• Kulkarni J, Mirrokni V (2015) Robust price of anarchy bounds via LP and Fenchel duality. Proc. 26th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 1030–1049.Google Scholar
• Long J, Szeto WY (2019) Link-based system optimum dynamic traffic assignment problems in general networks. Oper. Res. 67(1):167–182.Link, Google Scholar
• Long J, Huang H-J, Gao Z, Szeto WY (2013) An intersection-movement-based dynamic user optimal route choice problem. Oper. Res. 61(5):1134–1147.Link, Google Scholar
• Macko M, Larson K, Steskal Ľ (2013) Braess’s paradox for flows over time. Theory Comput. Systems 53(1):86–106.Crossref, Google Scholar
• Marcotte P, Nguyen S, Schoeb A (2004) A strategic flow model of traffic assignment in static capacitated networks. Oper. Res. 52(2):191–212.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):233–265.Crossref, Google Scholar
• Roughgarden T (2007) Routing games. Algorithmic Game Theory 18:459–484.Google Scholar
• Roughgarden T, Tardos É (2002) How bad is selfish routing? J. ACM 49(2):236–259.Crossref, Google Scholar
• Scarsini M, Schröder M, Tomala T (2018) Dynamic atomic congestion games with seasonal flows. Oper. Res. 66(2):327–339.Link, Google Scholar
• Selten R (1965) Spieltheoretische behandlung eines oligopolmodells mit nachfrageträgheit: Teil i: Bestimmung des dynamischen preisgleichgewichts. Zeitschrift für die gesamte Staatswissenschaft/J. Institut. Theoretical Econom. 2:301–324.Google Scholar
• Sering L, Koch LV (2019) Nash flows over time with spillback. Proc. 30th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 935–945.Google Scholar
• Sheffi Y (1985) Urban Transportation Networks, vol. 6 (Prentice-Hall, Englewood Cliffs, NJ).Google Scholar
• Vickrey WS (1969) Congestion theory and transport investment. Amer. Econom. Rev. 59(2):251–260.Google Scholar
• Wardrop JG (1952) Road paper: Some theoretical aspects of road traffic research. ICE Proc. Engrg. Divisions, vol. 1 (Thomas Telford, London), 325–362.Google Scholar
• Werth T, Holzhauser M, Krumke S (2014) Atomic routing in a deterministic queuing model. Oper. Res. Perspect. 1(1):18–41.Crossref, Google Scholar
• Yagar S (1971) Dynamic traffic assignment by individual path minimization and queuing. Transportation Res. 5(3):179–196.Crossref, Google Scholar