Undiscounted Recursive Path Choice Models: Convergence Properties and Algorithms

References

• Aguirregabiria V, Mira P (2002) Swapping the nested fixed point algorithm: A class of estimators for discrete Markov decision models. Econometrica 70(4):1519–1543.Crossref, Google Scholar
• Aguirregabiria V, Mira P (2010) Dynamic discrete choice structural models: A survey. J. Econometrics 156(1):38–67.Crossref, Google Scholar
• Arslan O, Jabali O, Laporte G (2018) Exact solution of the evasive flow capturing problem. Oper. Res. 66(6):1625–1640.Link, Google Scholar
• Baillon JB, Cominetti R (2008) Markovian traffic equilibrium. Math. Programming 111(1–2):33–56.Crossref, Google Scholar
• Bertsekas DP, Tsitsiklis JN (1991) An analysis of stochastic shortest path problems. Math. Oper. Res. 16(3):580–595.Link, Google Scholar
• Daly A, Bierlaire M (2006) A general and operational representation of generalised extreme value models. Transportation Res. Part B Methodological 40(4):285–305.Crossref, Google Scholar
• Finn C, Levine S, Abbeel P (2016) Guided cost learning: Deep inverse optimal control via policy optimization. Balcan MF, Weinberger KQ, eds. Proc. 33rd Internat. Conf. Machine Learn. (PMLR, New York), 48:49–58.Google Scholar
• Finn C, Christiano P, Abbeel P, Levine S (2016) A connection between generative adversarial networks, inverse reinforcement learning, and energy-based models. Preprint, submitted November 25, https://arxiv.org/abs/1611.03852.Google Scholar
• Fosgerau M, Frejinger E, Karlström A (2013) A link based network route choice model with unrestricted choice set. Transportation Res. Part B Methodological 56:70–80.Crossref, Google Scholar
• Frejinger E, Bierlaire M (2007) Capturing correlation with subnetworks in route choice models. Transportation Res. Part B Methodological 41(3):363–378.Crossref, Google Scholar
• Gilbert F, Marcotte P, Savard G (2015) A numerical study of the logit network pricing problem. Transportation Sci. 49(3):706–719.Link, Google Scholar
• Granas A, Dugundji J (2013) Fixed Point Theory (Springer-Verlag, New York).Google Scholar
• Hotz J, Miller RA (1993) Conditional choice probabilities and the estimation of dynamic models. Rev. Econom. Stud. 60(3):497–529.Crossref, Google Scholar
• Iskhakov F, Rust J, Schjerning B (2020) Machine learning and structural econometrics: Contrasts and synergies. Econom. J. 23(3):81–124.Crossref, Google Scholar
• Kalouptsidi M, Scott PT, Souza-Rodrigues E (2021) Linear IV regression estimators for structural dynamic discrete choice models. J. Econometrics 222(1 Part C):778–804.Crossref, Google Scholar
• Levine S, Popovic Z, Koltun V (2012) Nonlinear inverse reinforcement learning with Gaussian processes. Pereira F, Burges C, Bottou L, Weinberger K, eds. Proc. 25th Annual Conf. Neural Inform. Processing Systems (NIPS 2012, Granada, Spain), 24:19–27.Google Scholar
• Liu Y, Cirillo C (2018) A generalized dynamic discrete choice model for green vehicle adoption. Transportation Res. Part A Policy Practice 114:288–302.Crossref, Google Scholar
• Mai T, Bastin F, Frejinger E (2016) A decomposition method for estimating recursive logit based route choice models. EURO J. Transportation Logist. 7(3):253–275.Crossref, Google Scholar
• Mai T, Fosgerau M, Frejinger E (2015) A nested recursive logit model for route choice analysis. Transportation Res. Part B Methodological 75:100–112.Crossref, Google Scholar
• Mai T, Frejinger E, Bastin F (2015) A misspecification test for logit based route choice models. Econom. Transporation 4(4):215–226.Crossref, Google Scholar
• Ng AY, Russell SJ (2000) Algorithms for inverse reinforcement learning. Langley P, ed. Proc. 17th Internat. Conf. Machine Learn., Stanford University, CA, vol. 1 (ICML, Stanford, CA), 663–670.Google Scholar
• Nocedal J, Wright SJ (2006) Numerical Optimization, 2nd ed. (Springer, New York).Google Scholar
• Osorio C, Chong L (2015) A computationally efficient simulation-based optimization algorithm for large-scale urban transportation problems. Transportation Sci. 49(3):623–636.Link, Google Scholar
• Oyama Y, Hato E (2017) A discounted recursive logit model for dynamic gridlock network analysis. Transportation Res. Part C Emerging Tech. 85:509–527.Crossref, Google Scholar
• Prato CG (2009) Route choice modeling: Past, present and future research directions. J. Choice Model. 2:65–100.Crossref, Google Scholar
• Rambha T, Nozick LK, Davidson R (2021) Modeling hurricane evacuation behavior using a dynamic discrete choice framework. Transportation Res. Part B Methodological 150:75–100.Crossref, Google Scholar
• Rust J (1987) Optimal replacement of GMC bus engines: An empirical model of Harold Zurcher. Econometrica 55(5):999–1033.Crossref, Google Scholar
• Rust J (1988) Maximum likelihood estimation of discrete control processes. SIAM J. Control Optim. 26(5):1006–1024.Crossref, Google Scholar
• Su CL, Judd KL (2012) Constrained optimization approaches to estimation of structural models. Econometrica 80(5):2213–2230.Crossref, Google Scholar
• Västberg OB, Karlström A, Jonsson D, Sundberg M (2020) A dynamic discrete choice activity-based travel demand model. Transportation Sci. 54(1):21–41.Link, Google Scholar
• Ziebart BD, Maas AL, Bagnell JA, Dey AK (2008) Maximum entropy inverse reinforcement learning. Cohn A, ed. Proc. 23rd AAAI Conf. Artificial Intelligence (AAAI, Chicago), 8:1433–1438.Google Scholar
• Zimmermann M, Frejinger E (2020) A tutorial on recursive models for analyzing and predicting path choice behavior. EURO J. Transportation Logist. 9(2):100004.Crossref, Google Scholar
• Zimmermann M, Frejinger E, Marcotte P (2021) A strategic Markovian traffic equilibrium model for capacitated networks. Transportation Sci. 55(3):574–591.Link, Google Scholar
• Zimmermann M, Mai T, Frejinger E (2017) Bike route choice modeling using GPS data without choice sets of paths. Transportation Res. Part C Emerging Tech. 75:183–196.Crossref, Google Scholar