A dynamic programming approach for quickly estimating large network-based MEV models

We propose a way to estimate a family of static Multivariate Extreme Value (MEV) models with large choice sets in short computational time. The resulting model is also straightforward and fast to use for prediction. Following Daly and Bierlaire (2006), the correlation structure is defined by a roote...

Full description

Saved in:
Bibliographic Details
Main Authors: MAI, Tien, FREJINGER, Emma, FOSGEREAU, Mogens, BASTIN, Fabian
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2017
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/5284
https://ink.library.smu.edu.sg/context/sis_research/article/6287/viewcontent/1_s2.0_S0191261515302216_main.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-6287
record_format dspace
spelling sg-smu-ink.sis_research-62872020-09-09T04:55:45Z A dynamic programming approach for quickly estimating large network-based MEV models MAI, Tien FREJINGER, Emma FOSGEREAU, Mogens BASTIN, Fabian We propose a way to estimate a family of static Multivariate Extreme Value (MEV) models with large choice sets in short computational time. The resulting model is also straightforward and fast to use for prediction. Following Daly and Bierlaire (2006), the correlation structure is defined by a rooted, directed graph where each node without successor is an alternative. We formulate a family of MEV models as dynamic discrete choice models on graphs of correlation structures and show that the dynamic models are consistent with MEV theory and generalize the network MEV model (Daly and Bierlaire, 2006). Moreover, we show that these models can be estimated quickly using the concept of network flows and the nested fixed point algorithm (Rust, 1987). The main reason for the short computational time is that the new formulation allows to benefit from existing efficient solution algorithms for sparse linear systems of equations.We present numerical results based on simulated data with varying number of alternatives and nesting structures. We estimate large models, for example, a cross-nested model with 200 nests and 500,000 alternatives and 210 parameters that needs between 100–200 iterations to converge (4.3 h on an Intel(R) 3.2 GHz machine using a non-parallelized code). We also show that our approach allows to estimate a cross-nested logit model of 111 nests with a real data set of more than 100,000 observations in 14 h. 2017-04-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/5284 info:doi/10.1016/j.trb.2016.12.017 https://ink.library.smu.edu.sg/context/sis_research/article/6287/viewcontent/1_s2.0_S0191261515302216_main.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Multivariate extreme value models Dynamic programming Discrete choice Maximum likelihood estimation Nested fixed point algorithm Value iteration OS and Networks Programming Languages and Compilers
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Multivariate extreme value models
Dynamic programming
Discrete choice
Maximum likelihood estimation
Nested fixed point algorithm
Value iteration
OS and Networks
Programming Languages and Compilers
spellingShingle Multivariate extreme value models
Dynamic programming
Discrete choice
Maximum likelihood estimation
Nested fixed point algorithm
Value iteration
OS and Networks
Programming Languages and Compilers
MAI, Tien
FREJINGER, Emma
FOSGEREAU, Mogens
BASTIN, Fabian
A dynamic programming approach for quickly estimating large network-based MEV models
description We propose a way to estimate a family of static Multivariate Extreme Value (MEV) models with large choice sets in short computational time. The resulting model is also straightforward and fast to use for prediction. Following Daly and Bierlaire (2006), the correlation structure is defined by a rooted, directed graph where each node without successor is an alternative. We formulate a family of MEV models as dynamic discrete choice models on graphs of correlation structures and show that the dynamic models are consistent with MEV theory and generalize the network MEV model (Daly and Bierlaire, 2006). Moreover, we show that these models can be estimated quickly using the concept of network flows and the nested fixed point algorithm (Rust, 1987). The main reason for the short computational time is that the new formulation allows to benefit from existing efficient solution algorithms for sparse linear systems of equations.We present numerical results based on simulated data with varying number of alternatives and nesting structures. We estimate large models, for example, a cross-nested model with 200 nests and 500,000 alternatives and 210 parameters that needs between 100–200 iterations to converge (4.3 h on an Intel(R) 3.2 GHz machine using a non-parallelized code). We also show that our approach allows to estimate a cross-nested logit model of 111 nests with a real data set of more than 100,000 observations in 14 h.
format text
author MAI, Tien
FREJINGER, Emma
FOSGEREAU, Mogens
BASTIN, Fabian
author_facet MAI, Tien
FREJINGER, Emma
FOSGEREAU, Mogens
BASTIN, Fabian
author_sort MAI, Tien
title A dynamic programming approach for quickly estimating large network-based MEV models
title_short A dynamic programming approach for quickly estimating large network-based MEV models
title_full A dynamic programming approach for quickly estimating large network-based MEV models
title_fullStr A dynamic programming approach for quickly estimating large network-based MEV models
title_full_unstemmed A dynamic programming approach for quickly estimating large network-based MEV models
title_sort dynamic programming approach for quickly estimating large network-based mev models
publisher Institutional Knowledge at Singapore Management University
publishDate 2017
url https://ink.library.smu.edu.sg/sis_research/5284
https://ink.library.smu.edu.sg/context/sis_research/article/6287/viewcontent/1_s2.0_S0191261515302216_main.pdf
_version_ 1770575370815275008