The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Markovian Decision Processes with Uncertain Transition Probabilities
Abstract
This paper examines Markovian decision processes in which the transition probabilities corresponding to alternative decisions are not known with certainty. The processes are assumed to be finite-state, discrete-time, and stationary. The rewards axe time discounted. Both a game-theoretic and the Bayesian formulation are considered. In the game-theoretic formulation, variants of a policy-iteration algorithm are provided for both the max-min and the max-max cases. An implicit enumeration algorithm is discussed for the Bayesian formulation where upper and lower bounds on the total expected discounted return are provided by the max-max and max-min optimal policies. Finally, the paper discusses asymptotically Bayes-optimal policies.
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
Cites
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Cited by
Robust Control of Markov Decision Processes with Uncertain Transition Matrices
Nilim, A., & El Ghaoui, L. (2005) · Operations Research · doi:10.1287/opre.1050.0216 · Cited by 694
A survey of maintenance models: The control and surveillance of deteriorating systems
Pierskalla, W. P., & Voelker, J. A. (1976) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800230302 · Cited by 678
Iyengar, G. N. (2005) · Mathematics of Operations Research · doi:10.1287/moor.1040.0129 · Cited by 566
Reinforcement Learning: A Tutorial Survey and Recent Advances
Gosavi, A. (2009) · INFORMS Journal on Computing · doi:10.1287/ijoc.1080.0305 · Cited by 326
Robust Markov Decision Processes
Wiesemann, W., Kuhn, D., & Rustem, B. (2013) · Mathematics of Operations Research · doi:10.1287/moor.1120.0566 · Cited by 312
Metadata
- Authors
- Satia, J. K., & Lave, R. E.
- Venue
- Operations Research
- Published
- 1973-06
- Volume
- 21
- Issue
- 3
- Pages
- 728-740
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2069045459
- Cited by
- 224
- References
- 1
- FWCI
- 1.04
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Markovian Decision Processes with Uncertain Transition Probabilities. https://app.cochat.ai/papers/10.1287/opre.21.3.728
- The paper
- Satia, J. K., & Lave, R. E. (1973). Markovian Decision Processes with Uncertain Transition Probabilities. Operations Research. https://doi.org/10.1287/opre.21.3.728
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.