Dynamic Atomic Congestion Games with Seasonal Flows

References

• Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows. Theory, Algorithms, and Applications (Prentice Hall, Inc., Englewood Cliffs, NJ).Google Scholar
• Akamatsu T (2000) A dynamic traffic equilibrium assignment paradox. Transportation Res. Part B 34(6):515–531.Crossref, Google Scholar
• Akamatsu T (2001) An efficient algorithm for dynamic traffic equilibrium assignment with queues. Transportation Sci. 35(4):389–404.Link, Google Scholar
• Akamatsu T, Heydecker B (2003) Detecting dynamic traffic assignment capacity paradoxes in saturated networks. Transportation Sci. 37(2):123–138.Link, Google Scholar
• Anshelevich E, Ukkusuri S (2009) Equilibria in dynamic selfish routing. Mavronicolas M, Papadopoulou VG, eds. Algorithmic Game Theory, Vol. 5814 (Springer, Berlin), 171–182.Crossref, Google Scholar
• Anshelevich E, Dasgupta A, Kleinberg J, Tardos É, Wexler T, Roughgarden T (2008) The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4):1602–1623.Crossref, Google Scholar
• Bhaskar U, Fleischer L, Anshelevich E (2015a) A Stackelberg strategy for routing flow over time. Games Econom. Behav. 92:232–247.Crossref, Google Scholar
• Bhaskar U, Fleischer L, Huang CC (2010) The price of collusion in series-parallel networks. Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, Vol. 6080 (Springer, Berlin).Crossref, Google Scholar
• Bhaskar U, Fleischer L, Hoy D, Huang CC (2015b) On the uniqueness of equilibrium in atomic splittable routing games. Math. Oper. Res. 40(3):634–654.Link, Google Scholar
• Braess D (1968) Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12:258–268.Google Scholar
• Braess D, Nagurney A, Wakolbinger T (2005) On a paradox of traffic planning. Transportation Sci. 39(4):446–450.Link, Google Scholar
• Cao Z, Chen B, Chen X, Wang C (2017) A network game of dynamic traffic. Proc. 2017 ACM Conf. Econom. Computat., EC ’17 (ACM, New York), 695–696.Google Scholar
• Charnes A, Cooper WW (1961) Multicopy traffic network models. Herman R, ed. Theory of Traffic Flow (Elsevier, Amsterdam),85–96.Google Scholar
• Cominetti R (2015) Equilibrium routing under uncertainty. Math. Programming 151(1, Ser. B):117–151.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, Könemann J, eds. Proc. 19th Internat. Conf. Integer Programming Combinatorial Optimization, IPCO ’17. Lecture Notes in Computer Science, Vol. 10328 (Springer International, Cham, Switzerland), 161–172.Google Scholar
• Correa JR, Stier-Moses NE (2011) Wardrop equilibria. Cochran JJ, Cox LA, Keskinocak P, Kharoufeh JP, Smith JC, eds. Wiley Encyclopedia of Operations Research and Management Science (John Wiley & Sons, Hoboken, NJ).Crossref, Google Scholar
• Correa JR, Schulz AS, Stier-Moses NE (2004) Selfish routing in capacitated networks. Math. Oper. Res. 29(4):961–976.Link, Google Scholar
• Correa JR, Schulz AS, Stier-Moses NE (2007) Fast, fair, and efficient flows in networks. Oper. Res. 55(2):215–225.Link, Google Scholar
• Correa JR, Schulz AS, Stier-Moses NE (2008) A geometric approach to the price of anarchy in nonatomic congestion games. Games Econom. Behav. 64(2):457–469.Crossref, Google Scholar
• Daganzo CF (1998) Queue spillovers in transportation networks with a route choice. Transportation Sci. 32(1):3–11.Link, Google Scholar
• Farzad B, Olver N, Vetta A (2008) A priority-based model of routing. Chicago J. Theoret. Comput. Sci. Article 1, 29.Crossref, Google Scholar
• Fleischer L, Tardos É (1998) Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23(3–5):71–80.Crossref, Google Scholar
• Ford LR Jr, Fulkerson DR (1958) Constructing maximal dynamic flows from static flows. Oper. Res. 6(3):419–433.Link, Google Scholar
• Ford LR Jr, Fulkerson DR (1962) Flows in Networks (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Gale D (1959) Transient flows in networks. Michigan Math. J. 6(1):59–63.Crossref, Google Scholar
• Harker PT (1988) Multiple equilibrium behaviors on networks. Transportation Sci. 22(1):39–46.Link, Google Scholar
• Harks T, Végh LA (2007) Nonadaptive selfish routing with online demands. Janssen J, Prałat P, eds. Combinatorial and Algorithmic Aspects of Networking. Lecture Notes in Computer Science, Vol. 4852 (Springer, Berlin), 27–45.Crossref, Google Scholar
• Harks T, Heinz S, Pfetsch ME (2009) Competitive online multicommodity routing. Theory Comput. Systems 45(3):533–554.Crossref, Google Scholar
• Haurie A, Marcotte P (1985) On the relationship between Nash-Cournot and Wardrop equilibria. Networks 15(3):295–308.Crossref, 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 SH (2011) Competitive routing over time. Theoret. Comput. Sci. 412(39):5420–5432.Crossref, Google Scholar
• Hoppe B, Tardos É (2000) The quickest transshipment problem. Math. Oper. Res. 25(1):36–62.Link, Google Scholar
• Jarvis JJ, Ratliff HD (1982) Some equivalent objectives for dynamic network flow problems. Management Sci. 28(1):106–109.Link, Google Scholar
• Koch R (2012) Routing games over time. Ph.D. thesis, Technische Universität Berlin.Google Scholar
• Koch R, Skutella M (2011) Nash equilibria and the price of anarchy for flows over time. Theory Comput. Syst. 49(1):71–97.Crossref, Google Scholar
• Koch R, Nasrabadi E, Skutella M (2011) Continuous and discrete flows over time: A general model based on measure theory. Math. Methods Oper. Res. 73(3):301–337.Crossref, Google Scholar
• Korte B, Vygen J (2012) Combinatorial Optimization, 5th ed. (Springer, Heidelberg).Crossref, Google Scholar
• Koutsoupias E, Papadimitriou C (1999) Worst-case equilibria. STACS 99 (Trier). Lecture Notes in Computer Science, Vol. 1563 (Springer, Berlin), 404–413.Crossref, Google Scholar
• Macko M, Larson K, Steskal L (2013) Braess’s paradox for flows over time. Theory Comput. Systems 53(1):86–106.Crossref, Google Scholar
• Milchtaich I (2006) Network topology and the efficiency of equilibrium. Games Econom. Behav. 57(2):321–346.Crossref, Google Scholar
• Minieka E (1973) Maximal, lexicographic, and dynamic network flows. Oper. Res. 21(2):517–527.Link, Google Scholar
• Monderer D, Shapley LS (1996) Potential games. Games Econom. Behav. 14(1):124–143.Crossref, Google Scholar
• Mounce R (2006) Convergence in a continuous dynamic queueing model for traffic networks. Transportation Res. Part B 40(9):779–791.Crossref, Google Scholar
• Mounce R (2007) Convergence to equilibrium in dynamic traffic networks when route cost is decay monotone. Transportation Sci. 41(3):409–414.Link, Google Scholar
• Papadimitriou C (2001) Algorithms, games, and the Internet. Vitter JS, Spirakis PG, Yannakakis M, eds. Proc. 33rd Annual ACM Sympos. Theory Comput., STOC ’01 (ACM, New York), 749–753.Google Scholar
• Philpott AB (1990) Continuous-time flows in networks. Math. Oper. Res. 15(4):640–661.Link, Google Scholar
• Rosenthal RW (1973) A class of games possessing pure-strategy Nash equilibria. Internat. J. Game Theory 2:65–67.Crossref, Google Scholar
• Roughgarden T (2005) Selfish Routing and the Price of Anarchy (MIT Press, Cambridge, MA).Google Scholar
• Roughgarden T (2006) On the severity of Braess’s Paradox: Designing networks for selfish users is hard. J. Comput. System Sci. 72(5):922–953.Crossref, Google Scholar
• Roughgarden T, Tardos É (2002) How bad is selfish routing? J. ACM 49(2):236–259.Crossref, Google Scholar
• Roughgarden T, Tardos É (2004) Bounding the inefficiency of equilibria in nonatomic congestion games. Games Econom. Behav. 47(2):389–403.Crossref, Google Scholar
• Roughgarden T, Tardos É (2007) Introduction to the inefficiency of equilibria. Algorithmic Game Theory (Cambridge University Press, Cambridge, UK), 443–459.Crossref, Google Scholar
• Schrijver A (2003) Combinatorial Optimization. Polyhedra and Efficiency (Springer, Berlin).Google Scholar
• Schulz AS, Stier Moses N (2003) On the performance of user equilibria in traffic networks. Proc. Fourteenth Annual ACM-SIAM Sympos. Discrete Algorithms, SODA ’03 (ACM, New York), 86–87.Google Scholar
• Shah D, Shin J (2010) Dynamics in congestion games. Proc. ACM SIGMETRICS Internat. Conf. Measurement and Modeling of Comput. Systems—SIGMETRICS ’10 ( ACM, New York).Google Scholar
• Skutella M (2009) An introduction to network flows over time. Research Trends in Combinatorial Optimization (Springer, Berlin), 451–482.Crossref, Google Scholar
• Tekin C, Liu M, Southwell R, Huang J, Ahmad SHA (2012) Atomic congestion games on graphs and their applications in networking. IEEE/ACM Trans. Networks 20(5):1541–1552.Crossref, Google Scholar
• Vickrey WS (1969) Congestion theory and transport investment. Amer. Econom. Rev. 59(2):251–260.Google Scholar
• Wardrop JG (1952) Some theoretical aspects of road traffic research. Proc. Inst. Civil Engineers, 1(3):325–378.Google Scholar
• Werth TL, Holzhauser M, Krumke SO (2014) Atomic routing in a deterministic queuing model. Oper. Res. Perspect. 1(1):18–41.Crossref, Google Scholar
• Wilkinson WL (1971) An algorithm for universal maximal dynamic flows in a network. Oper. Res. 19(7):1602–1612.Link, Google Scholar
• Xia Y, Hill D (2013) Dynamic Braess’s paradox in complex communication networks. IEEE Trans. Circuits and Systems II: Express Briefs 60(3):172–176.Crossref, Google Scholar
• Yagar S (1971) Dynamic traffic assignment by individual path minimization and queuing. Transportation Res. 5(3):179–196.Crossref, Google Scholar