The DOI matches its Crossref record.
Introduction to Stochastic Dynamic Programming.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992698 · Cited by 9,083
Markov decision processes: Discrete stochastic dynamic programming
Hazeghi, K., & Puterman, M. L. (1995) · Journal of the American Statistical Association · doi:10.2307/2291177 · Cited by 8,037
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1023/a:1022676722315 · Cited by 3,907
Learning to act using real-time dynamic programming
Barto, A. G., Bradtke, S. J., & Singh, S. P. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(94)00011-o · Cited by 1,104
Recent Advances in Hierarchical Reinforcement Learning
Barto, A. G., & Mahadevan, S. (2003) · Discrete Event Dynamic Systems · doi:10.1023/a:1022140919877 · Cited by 1,024
The Common Currency for Behavioral Decisions
McNamara, J. M., & Houston, A. I. (1986) · The American Naturalist · doi:10.1086/284489 · Cited by 624
Bio-inspired computation: Where we stand and what's next
Del Ser, J., Osaba, E., Molina, D., Yang, X.-S., Salcedo-Sanz, S., Camacho, D., Das, S., Suganthan, P. N., Coello Coello, C. A., & Herrera, F. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.04.008 · Cited by 593
Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey
Arapostathis, A., Borkar, V. S., Fernández-Gaucherand, E., Ghosh, M. K., & Marcus, S. I. (1993) · SIAM Journal on Control and Optimization · doi:10.1137/0331018 · Cited by 592
Towards a Unifield Foraging Theory
Mangel, M., & Clark, C. W. (1986) · Ecology · doi:10.2307/1938669 · Cited by 542
Policy optimization for dynamic power management
Benini, L., Bogliolo, A., Paleologo, G. A., & De Micheli, G. (1999) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.766730 · Cited by 433
Lippman, S. A., & McCardle, K. F. (1997) · Operations Research · doi:10.1287/opre.45.1.54 · Cited by 416
White, C. C., & White, D. J. (1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90348-2 · Cited by 415
Average reward reinforcement learning: Foundations, algorithms, and empirical results
Mahadevan, S. (1996) · Machine Learning · doi:10.1007/bf00114727 · Cited by 385
Fundamental concepts of qualitative probabilistic networks
Wellman, M. P. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90026-v · Cited by 364
Dynamic models in behavioural and evolutionary ecology
Houston, A., Clark, C., McNamara, J., & Mangel, M. (1988) · Nature · doi:10.1038/332029a0 · Cited by 340
Building on the Ideal Free Distribution
Tregenza, T. (1995) · Advances in Ecological Research · doi:10.1016/s0065-2504(08)60067-7 · Cited by 332
A Review of Modern Computational Algorithms for Bayesian Optimal Design
Ryan, E. G., Drovandi, C. C., McGree, J. M., & Pettitt, A. N. (2016) · International Statistical Review · doi:10.1111/insr.12107 · Cited by 312
A Reinforcement Learning Method for Maximizing Undiscounted Rewards
Schwartz, A. (1993) · Machine Learning Proceedings 1993 · doi:10.1016/b978-1-55860-307-3.50045-9 · Cited by 308
Learning to perceive and act by trial and error
Whitehead, S. D., & Ballard, D. H. (1991) · Machine Learning · doi:10.1007/bf00058926 · Cited by 300
Transfer of learning by composing solutions of elemental sequential tasks
Singh, S. P. (1992) · Machine Learning · doi:10.1007/bf00992700 · Cited by 288
Incremental multi-step Q-learning
Peng, J., & Williams, R. J. (1996) · Machine Learning · doi:10.1007/bf00114731 · Cited by 286
Finding approximate POMDP solutions through belief compression
Roy, N., Gordon, G., & Thrun, S. (2005) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1496 · Cited by 254
Metadata
- Authors
- Berry, D. A., & Ross, S. M.
- Venue
- Journal of the American Statistical Association
- Publisher
- JSTOR
- Published
- 1986-06
- Volume
- 81
- Issue
- 394
- Pages
- 573
- ISSN
- 0162-1459 (ISSN-L)
- OpenAlex
- W2035446426
- Cited by
- 1,133
- References
- 0
- FWCI
- 36.74
- 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.