Estimating Markov Chain Mixing Times: Convergence Rate Towards Equilibrium of a Stochastic Process Traffic Assignment Model

Published Online:https://doi.org/10.1287/trsc.2024.0523

References

  • Arieli I, Young HP (2016) Stochastic learning dynamics and speed of convergence in population games. Econometrica 84(2):627–676.CrossrefGoogle Scholar
  • Balijepalli N, Watling D, Liu R (2007) Doubly dynamic traffic assignment: Simulation modeling framework and experimental results. Transportation Res. Record 2029:39–48.CrossrefGoogle Scholar
  • Cantarella GE, Cascetta E (1995) Dynamic processes and equilibrium in transportation networks: Towards a unifying theory. Transportation Sci. 29(4):305–329.LinkGoogle Scholar
  • Cantarella G, Watling D (2016) Modelling road traffic assignment as a day-to-day dynamic, deterministic process: A unified approach to discrete- and continuous-time models. EURO J. Transportation Logist. 5(1):69–98.CrossrefGoogle Scholar
  • Cantarella G, Velonà P, Watling D (2015) Day-to-day dynamics and equilibrium stability in a two-mode transport system with responsive bus operator strategies. Networks Spatial Econom. 15:485–506.CrossrefGoogle Scholar
  • Cascetta E (1989) A stochastic process approach to the analysis of temporal dynamics in transportation networks. Transportation Res. Part B Methodological 23(1):1–17.CrossrefGoogle Scholar
  • Cascetta E, Cantarella GE (1991) A day-to-day and within-day dynamic stochastic assignment model. Transportation Res. Part A General 25(5):277–291.CrossrefGoogle Scholar
  • Chien S, Sinclair A (2011) Convergence to approximate Nash equilibria in congestion games. Games Econom. Behav. 71(2):315–327.CrossrefGoogle Scholar
  • Fukuda D, Morichi S (2007) Incorporating aggregate behavior in an individual’s discrete choice: An application to analyzing illegal bicycle parking behavior. Transportation Res. Part A Policy Practice 41(4):313–325.CrossrefGoogle Scholar
  • Guo RY, Yang H, Huang HJ (2018) Are we really solving the dynamic traffic equilibrium problem with a departure time choice? Transportation Sci. 52(3):603–620.LinkGoogle Scholar
  • Hazelton ML (2002) Day-to-day variation in Markovian traffic assignment models. Transportation Res. Part B Methodological 36(7):637–648.CrossrefGoogle Scholar
  • Hazelton ML, Watling DP (2004) Computation of equilibrium distributions of Markov traffic-assignment models. Transportation Sci. 38(3):331–342.LinkGoogle Scholar
  • Hofbauer J, Sandholm WH (2007) Evolution in games with randomly disturbed payoffs. J. Econom. Theory 132(1):47–69.CrossrefGoogle Scholar
  • Iryo T (2008) An analysis of instability in a departure time choice problem. J. Adv. Transportation 42(3):333–356.CrossrefGoogle Scholar
  • Iryo T (2011) Multiple equilibria in a dynamic traffic network. Transportation Res. Part B Methodological 45(6):867–879.CrossrefGoogle Scholar
  • Iryo T (2015) Investigating factors for existence of multiple equilibria in dynamic traffic network. Networks Spatial Econom. 15(3):599–616.CrossrefGoogle Scholar
  • Iryo T (2019) Instability of departure time choice problem: A case with replicator dynamics. Transportation Res. Part B Methodological 126:353–364.CrossrefGoogle Scholar
  • Iryo T, Watling D (2019) Properties of equilibria in transport problems with complex interactions between users. Transportation Res. Part B Methodological 126:87–114.CrossrefGoogle Scholar
  • Jin WL (2020) Stable day-to-day dynamics for departure time choice. Transportation Sci. 54(1):42–61.Google Scholar
  • Jin WL (2021) Stable local dynamics for day-to-day departure time choice. Transportation Res. Part B Methodological 149:463–479.CrossrefGoogle Scholar
  • Levin DA, Peres Y (2017) Markov Chains and Mixing Times, vol. 107 (American Mathematical Society, Providence, RI).CrossrefGoogle Scholar
  • Mohring H (1972) Optimization and scale economies in urban bus transportation. Amer. Econom. Rev. 62(4):591–604.Google Scholar
  • Parry K, Watling DP, Hazelton ML (2016) A new class of doubly stochastic day-to-day dynamic traffic assignment models. EURO J. Transportation Logist. 5(1):5–23.CrossrefGoogle Scholar
  • Satsukawa K, Wada K, Iryo T (2019) Stochastic stability of dynamic user equilibrium in unidirectional networks: Weakly acyclic game approach. Transportation Res. Part B Methodological 125:229–247.CrossrefGoogle Scholar
  • Sinclair A (1992) Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics Probability Comput. 1(4):351–370.CrossrefGoogle Scholar
  • Vickrey WS (1969) Congestion theory and transport investment. Amer. Econom. Rev. 59(2):251–260.Google Scholar
  • Watling DP (1996) Asymmetric problems and stochastic process models of traffic assignment. Transportation Res. Part B Methodological 30(5):339–357.CrossrefGoogle Scholar
  • Watling DP, Cantarella GE (2013) Modelling sources of variation in transportation systems: Theoretical foundations of day-to-day dynamic models. Transportmetrica B Transport Dynamics 1(1):3–32.CrossrefGoogle Scholar
  • Watling DP, Cantarella GE (2015) Model representation and decision-making in an ever-changing world: The role of stochastic process models of transportation systems. Networks Spatial Econom. 15:843–882.CrossrefGoogle Scholar
  • Watling DP, Hazelton ML (2018) Asymptotic approximations of transient behaviour for day-to-day traffic models. Transportation Res. Part B Methodological 118:90–105.CrossrefGoogle Scholar
  • Watling D, Milne D, Clark S (2012) Network impacts of a road capacity reduction: Empirical analysis and model predictions. Transportation Res. Part A Policy Practice 46(1):167–189.CrossrefGoogle Scholar
  • Zhu S, Levinson D, Liu HX, Harder K (2010) The traffic and behavioral effects of the I-35W Mississippi River bridge collapse. Transportation Res. Part A Policy Practice 44(10):771–784.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.