The solution and estimation of discrete choice dynamic programming models by simulation and interpolation: Monte Carlo evidence
Abstract: Over the past decade, a substantial literature on the estimation of discrete choice dynamic programming (DC-DP) models of behavior has developed. However, this literature now faces major computational barriers. Specifically, in order to solve the dynamic programming (DP) problems that generate agents' decision rules in DC-DP models, high dimensional integrations must be performed at each point in the state space of the DP problem. In this paper we explore the performance of approximate solutions to DP problems. Our approximation method consists of: 1) using Monte Carlo integration to simulate the required multiple integrals at a subset of the state points, and 2) interpolating the non-simulated values using a regression function. The overall performance of this approximation method appears to be excellent, both in terms of the degree to which it mimics the exact solution, and in terms of the parameter estimates it generates when embedded in an estimation algorithm.
File(s): File format is application/pdf http://www.minneapolisfed.org/research/common/pub_detail.cfm?pb_autonum_id=462
Provider: Federal Reserve Bank of Minneapolis
Part of Series: Staff Report
Publication Date: 1994