.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Dynamic discrete choice
Numerical solution
Monte Carlo
Sieves
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
5.3K
被引数:
3.0W
机构
引用论文
分享收藏A METHOD OF SIMULATED MOMENTS FOR ESTIMATION OF DISCRETE RESPONSE MODELS WITHOUT NUMERICAL-INTEGRATION.png)
ECONOMETRICA
OAAI
ECONOMETRICAIF7.1
OAAI分享收藏
查看更多内容