The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Using Randomization to Break the Curse of Dimensionality
Abstract
This paper introduces random versions of successive approximations and multigrid algorithms for computing approximate solutions to a class of finite and infinite horizon Markovian decision problems (MDPs). We prove that these algorithms succeed in breaking the “curse of dimensionality ” for a subclass of MDPs known as discrete decision processes (DDPs). 1
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Puterman, M. L. (1994) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316887 · Cited by 6,024
Empirical Processes with Applications to Statistics
Shorack, G. R., & Wellner, J. A. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719017 · Cited by 2,310
Freimer, M., Bellman, R. E., & Dreyfus, S. E. (1964) · Journal of the American Statistical Association · doi:10.2307/2282884 · Cited by 2,153
Optimal Replacement of GMC Bus Engines: An Empirical Model of Harold Zurcher
Rust, J. (1987) · Econometrica · doi:10.2307/1911259 · Cited by 1,724
Self-citationQuadrature-Based Methods for Obtaining Approximate Solutions to Nonlinear Asset Pricing Models
Tauchen, G., & Hussey, R. (1991) · Econometrica · doi:10.2307/2938261 · Cited by 925
Discounted Dynamic Programming
Blackwell, D. (1965) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177700285 · Cited by 918
A General Theory of Optimal Algorithms
Traub, J. F., & Woźniakowski, H. (1980) · Medical Entomology and Zoology · Cited by 602
Computational Solution of Nonlinear Operator Equations
O., J. M., & Rall, L. B. (1970) · Mathematics of Computation · doi:10.2307/2004896 · Cited by 523
Structural estimation of markov decision processesPreprint
Rust, J. P. (1986) · RePEc: Research Papers in Economics · Cited by 501
Self-citationKeane, M. P., & Wolpin, K. I. (1994) · The Review of Economics and Statistics · doi:10.2307/2109768 · Cited by 479
Numerical dynamic programming in economicsPreprint
Rust, J. P. (1996) · RePEc: Research Papers in Economics · Cited by 237
Self-citationConvergence of discretization procedures in dynamic programming
Bertsekas, D. (1975) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1975.1100984 · Cited by 181
On the Convergence of Policy Iteration in Stationary Dynamic Programming
Puterman, M. L., & Brumelle, S. L. (1979) · Mathematics of Operations Research · doi:10.1287/moor.4.1.60 · Cited by 146
Central limit theorems for C(S)-valued random variables
Jain, N. C., & Marcus, M. B. (1975) · Journal of Functional Analysis · doi:10.1016/0022-1236(75)90056-7 · Cited by 117
Asymptotics via Empirical Processes
Pollard, D. (1989) · Statistical Science · doi:10.1214/ss/1177012394 · Cited by 108
A unified framework for the discretization of nonlinear operator equations
Anselone, P. M., & Ansorge, R. (1981) · Numerical Functional Analysis and Optimization · doi:10.1080/01630568108816106 · Cited by 16
Pakes, A., & McGuire, P. (1997) · RePEc: Research Papers in Economics · Cited by 6
Cited by
Discrete Choice Methods with Simulation
Train, K. E. (2001) · doi:10.1017/cbo9780511805271 · Cited by 7,784
Reinforcement learning in robotics: A survey
Kober, J., Bagnell, J. A., & Peters, J. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913495721 · Cited by 3,160
Algorithms for Reinforcement Learning
Szepesvári, C. (2010) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01551-9 · Cited by 1,049
Market Entry Costs, Producer Heterogeneity, and Export Dynamics
Das, S., Roberts, M. J., & Tybout, J. R. (2007) · Econometrica · doi:10.1111/j.1468-0262.2007.00769.x · Cited by 859
Monte Carlo methods for security pricing
Boyle, P., Broadie, M., & Glasserman, P. (1997) · Journal of Economic Dynamics and Control · doi:10.1016/s0165-1889(97)00028-6 · Cited by 854
Metadata
- Authors
- Rust, J.
- Venue
- Econometrica
- Publisher
- JSTOR
- Published
- 1997-05
- Volume
- 65
- Issue
- 3
- Pages
- 487
- ISSN
- 0012-9682 (ISSN-L)
- OpenAlex
- W1563483395
- Cited by
- 407
- References
- 18
- FWCI
- 11.65
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.