.png){kind=icon}
.png){kind=icon}
Return
Solving dynamic discrete choice models using smoothing and sieve methods
.png){kind=icon}
OA
AI
DOI：10.1016/j.jeconom.2020.02.007.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose to combine smoothing, simulations and sieve approximations to solve for either the integrated or expected value function in a general class of dynamic discrete choice (DDC) models. We use importance sampling to approximate the Bellman operators defining the two functions. The random Bellman operators, and therefore also the corresponding solutions, are generally non-smooth which is undesirable. To circumvent this issue, we introduce smoothed versions of the random Bellman operators and solve for the corresponding smoothed value functions using sieve methods. We also show that one can avoid using sieves by generalizing and adapting the self-approximating'' method of Rust (1997b) to our setting. We provide an asymptotic theory for both approximate solution methods and show that they converge with root N-rate, where N is number of Monte Carlo draws, towards Gaussian processes. We examine their performance in practice through a set of numerical experiments and find that both methods perform well with the sieve method being particularly attractive in terms of computational speed and accuracy. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Dynamic discrete choice
Numerical solution
Monte Carlo
Sieves
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
5.2K
Citations:
3.0W
View more organizations