Using randomization to break the curse of dimensionality

Econometrica

Volumn 65, Issue 3, 1997, Pages 487-516

  Rust, John ^a  

^a NONE

Author keywords

Bellman operator; Computational complexity; Curse of dimensionality; Dynamic programming; Empirical processes; Maximal inequalities; Random Bellman operator

Indexed keywords

EID: 0001509947     PISSN: 00129682     EISSN: None     Source Type: Journal    
DOI: 10.2307/2171751     Document Type: Article

References (43)

1. ANDERSON, E., L. HANSEN, E. MCGRATTEN, AND T. SARGENT (1996): "Mechanics for Forming and Estimating Dynamic Linear Economics," in Handbook of Computational Economics, ed. by H. Amman, D. Kendrick and J. Rust. Amsterdam: Elsevier, Ch. 4, 171-252.
2. ANSELONE, P. M. (1971): Collectively Compact Operator Approximation Theory and Application to Integral Equations, Prentice Hall Series on Automatic Computation. Englewood Cliffs, New Jersey: Prentice Hall.
3. ANSELONE, P. M., AND R. ANSORGE (1981): "A Unified Framework for the Discretization of Nonlinear Operator Equations," Numerical Functional Analysis and Optimization, 4, 61-99.
4. BAKHVALOV, N. S. (1964): "On Optimal Estimates of the Rate of Convergence of Quadrature Processes and Integration Methods of the Monte Carlo Type," in the miscellany: Numerical Methods for Solving Differential and Integral Equations and Quadrature Formulae. Moscow: Nauka, 5-63 (in Russian).
5. BARTO, A. G., S. J. BRADTKE, AND S. SINGH (1995): "Learning to Act Using Real-Time Dynamic Programming," Artificial Intelligence, 72, 81-138.
6. BELLMAN, R. (1957): Dynamic Programming. Princeton, NJ: Princeton University Press.
7. _ (1970):
8. BELLMAN, R., AND S. DREYFUS (1962): Applied Dynamic Programming. Princeton, NJ: Princeton University Press.
9. BELLMAN, R., R. KALABA, AND B. KOTKIN (1963): "Polynomial Approximation: A New Technique in Dynamic Programming Allocation Processes," Mathematics of Computation, 17, 155-161.
10. BERTSEKAS, D. (1975): "Convergence of Discretization Procedures in Dynamic Programming," IEEE Transactions on Automatic Control, 20, 415-419.
11. BLACKWELL, D. (1965): "Discounted Dynamic Programming," Annals of Mathematical Statistics, 36, 226-235.
12. CHOW, C. S., AND J. N. TSITSIKLIS (1989): "The Complexity of Dynamic Programming," Journal of Complexity, 5, 466-488.
13. _ (1991): "An Optimal Multigrid Algorithm for Continuous State Discrete Time Stochastic Control," IEEE Transactions on Automatic Control, 36, 898-914.
14. DANIEL, J. W. (1976): "Splines and Efficiency in Dynamic Programming," Journal of Mathematical Analysis and Applications, 54, 402-407.
15. DENARDO, E. V. (1967): "Contraction Mappings Underlying the Theory of Dynamic Programming," SIAM Review, 9, 165-177.
16. FOX, B. L. (1973): "Discretizing Dynamic Programming," Journal of Optimization Theory and its Applications, 11, 228-234.
17. GÄNßLER, P. (1983): Empirical Processes, Volume Three in Lecture Notes Series. Hayward, California: Institute of Mathematical Statistics.
18. HAMMERSLEY, J. J., AND D. C. HANDSCOMB (1992): Monte Carlo Methods. London: Chapman and Hall.
19. JAIN, N. C., AND M. B. MARCUS (1975): "Central Limit Theorems for C(S)-valued Random Variables," Journal of Functional Analysis, 19, 216-231.
20. JUDD, K. (1996): "Approximation, Perturbation, and Projection Methods in Economic Analysis," in Handbook of Computational Economics, ed. by H. Amman, D. Kendrick, and J. Rust. Amsterdam: Elsevier-North Holland, Ch. 12, 511-585.
21. KEANE, M. P., AND K. I. WOLPIN (1994): "The Solution and Estimation of Discrete Choice Dynamic Programming Models by Simulation and Interpolation: Monte Carlo Evidence," Review of Economics and Statistics, 76, 648-672.
22. KRASNOSEL'SKII, M. A., G. M. VAINIKKO, P. P. ZABREIKO, YA. B. RUTITSKII, AND V. YA. STETSENKO (1972): Approximate Solution of Operator Equations, D. Louvish, translator. Groningen: Wolters-Noordhoff Publishing.
23. NIEDERREITER, H. (1992): Random Number Generation and Quasi-Monte Carlo Methods, Vol. 63. Philadelphia: SIAM CBMS-NSF Conference Series in Applied Mathematics.
24. PAKES, A., AND P. MCGUIRE (1996): "Stochastic Algorithms for Dynamic Models: Markov Perfect Equilibrium and the 'Curse of Dimensionality'," manuscript, Yale University.
25. PASKOV, S. (1996): "New Methodologies for Valuing Securities," ed. by S. Pliska and M. Dempster. Cambridge, England: Isaac Newton Institute.
26. PASKOV, S. AND J. F. TRAUB (1996): "Faster Evaluation of Financial Derivatives," Journal of Portfolio Management," forthcoming.
27. POLLARD, D. (1989): "Asymptotics via Empirical Processes," Statistical Science, 4, 341-386.
28. PUTERMAN, M. L. (1990): "Markov Decision Processes," in Handbooks in Operations Research and Management Science, Vol. 2, ed. by D. P. Heyman and M. J. Sobel. Amsterdam: Elsevier.
29. _ (1994): Markov Decision Processes. New York: Wiley.
30. PUTERMAN, M. L., AND S. BRUMELLE (1979): "On the Convergence of Policy Iteration in Stationary Dynamic Programming," Mathematics of Operations Research, 4, 60-69.
31. ROTH, K. F. (1954): "On Irregularities of Distribution," Mathematika, 1, 73-79.
32. RUST, J. (1994): "Structural Estimation of Markov Decision Processes," in Handbook of Econometrics, 4, ed. by D. McFadden and R. Engle. Amsterdam: North Holland, Chapter 51, 3082-3139.
33. _ (1996): "Numerical Dynamic Programming in Economics," in Handbook of Computational Economics, ed. by H. Amman, D. Kendrick, and J. Rust. Amsterdam: Elsevier-North Holland, Ch. 14, 620-729.
34. SANTOS, M., AND J. VIGO (1996): "Accuracy Estimates for a Numerical Approach to Stochastic Growth Models," Manuscript, ITAM, Mexico.
35. TAUCHEN, G., AND R. HUSSEY (1991): "Quadrature-Based Methods for Obtaining Approximate Solutions to Nonlinear Asset Pricing Models," Econometrica, 59, 371-396.
36. TRAUB, J. F., G. W. WASILKOWSKI, AND H. WOŹNIAKOWSKI (1988): Information-based Complexity. New York: Academic Press.
37. TRAUB, J. F., AND H. WOŹNIAKOWSKI (1992): "The Monte Carlo Algorithm with a Pseudorandom Generator," Mathematics of Computation, 58, 323-339.
38. TSITSIKLIS, J. N. (1994): "Asynchronous Stochastic Approximation and Q-Learning," Machine Learning, 16, 185-202.
39. WERSCHULZ, A. G. (1991): The Computational Complexity of Differential and Integral Equations. New York: Oxford University Press.
40. WOŹNIAKOWSKI, H. (1991): "Average Case Complexity of Multivariate Integration," Bulletin of the American Mathematical Society, 24, 185-194.
41. YUDIN, D. B., AND A. B. NEMIROVSKY (1976a): "Estimating the Computational Complexity of Mathematical Programming Problems," Ekonomika i Matem. Metody, 12, 128-142 (in Russian).
42. _ (1976b): "Computational Complexity and Efficiency of Methods for Solving Convex Extremum Problems," Ekonomika i Matem. Metody, 12, 357-369 (in Russian).
43. _ (1977): "Efficiency of Random Search in Control Problems," Izvestiya Akad. Nauk SSSR, Tekhnischeskaya Kibernetika, 3, 3-17 (in Russian).