Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
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
Bellman, R. (1957) · Indiana University Mathematics Journal · doi:10.1512/iumj.1957.6.56038 · Cited by 2,408
Cited by
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
An Analysis of Stochastic Shortest Path Problems
Bertsekas, D. P., & Tsitsiklis, J. N. (1991) · Mathematics of Operations Research · doi:10.1287/moor.16.3.580 · Cited by 488
Optimal maintenance models for systems subject to failure–A Review
Sherif, Y. S., & Smith, M. L. (1981) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800280104 · Cited by 409
Average reward reinforcement learning: Foundations, algorithms, and empirical results
Mahadevan, S. (1996) · Machine Learning · doi:10.1007/bf00114727 · Cited by 385
On lipschitz continuity of the solution mapping to the skorokhod problem, with applications
Dupuis, P., & Ishii, H. (1991) · Stochastics and Stochastic Reports · doi:10.1080/17442509108833688 · Cited by 255
Metadata
- Authors
- Veinott, A. F.
- Venue
- The Annals of Mathematical Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 1969-10
- Volume
- 40
- Issue
- 5
- Pages
- 1635-1660
- ISSN
- 0003-4851 (ISSN-L)
- OpenAlex
- W2001015965
- Cited by
- 248
- References
- 2
- FWCI
- 2.86
- Type
- journal article
- Language
- en
- Open access
- diamond
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.