Solving higher-dimensional continuous-time stochastic control problems by value function regression
The paper develops a method to solve higher-dimensional stochastic control problems in continuous time. A finite difference type approximation scheme is used on a coarse grid of low discrepancy points, while the value function at intermediate points is obtained by regression. The stability properties of the method are discussed, and applications are given to test problems of up to 10 dimensions. Accurate solutions to these problems can be obtained on a personal computer.
(This abstract was borrowed from another version of this item.)
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Michael P. Keane & Kenneth I. Wolpin, 1994.
"The solution and estimation of discrete choice dynamic programming models by simulation and interpolation: Monte Carlo evidence,"
181, Federal Reserve Bank of Minneapolis.
- Keane, Michael P & Wolpin, Kenneth I, 1994. "The Solution and Estimation of Discrete Choice Dynamic Programming Models by Simulation and Interpolation: Monte Carlo Evidence," The Review of Economics and Statistics, MIT Press, vol. 76(4), pages 648-72, November.
- Judd, Kenneth L., 1992. "Projection methods for solving aggregate growth models," Journal of Economic Theory, Elsevier, vol. 58(2), pages 410-452, December.
- Michael Reiter, . "Solving Higher-Dimensional Continuous Time Stochastic Control Problems by Value Function Interpolation," Computing in Economics and Finance 1997 135, Society for Computational Economics.
- John Rust, 1997. "A Comparison of Policy Iteration Methods for Solving Continuous-State, Infinite-Horizon Markovian Decision Problems Using Random, Quasi-random, and Deterministic Discretizations," Computational Economics 9704001, EconWPA.
- Rust, John, 1996. "Numerical dynamic programming in economics," Handbook of Computational Economics, in: H. M. Amman & D. A. Kendrick & J. Rust (ed.), Handbook of Computational Economics, edition 1, volume 1, chapter 14, pages 619-729 Elsevier.
- John Rust, 1997.
"Using Randomization to Break the Curse of Dimensionality,"
Econometric Society, vol. 65(3), pages 487-516, May.
- John Rust & Department of Economics & University of Wisconsin, 1994. "Using Randomization to Break the Curse of Dimensionality," Computational Economics 9403001, EconWPA, revised 04 Jul 1994.
When requesting a correction, please mention this item's handle: RePEc:eee:dyncon:v:23:y:1999:i:9-10:p:1329-1353. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.