The DOI matches its Crossref record.
Markov Decision Processes with Imprecise Transition Probabilities
Abstract
We present new numerical algorithms and bounds for the infinite horizon, discrete stage, finite state and action Markov decision process with imprecise transition probabilities. We assume that the transition probability mass vector for each state and action is described by a finite number of linear inequalities. This model of imprecision appears to be well suited for describing statistically determined confidence limits and/or natural language statements of likelihood. The numerical procedures for calculating an optimal max-min strategy are based on successive approximations, reward revision, and modified policy iteration. The bounds that are determined are at least as tight as currently available bounds for the case where the transition probabilities are precise.
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
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
Iyengar, G. N. (2005) · Mathematics of Operations Research · doi:10.1287/moor.1040.0129 · Cited by 566
White, C. C., & White, D. J. (1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90348-2 · Cited by 415
Self-citationReinforcement 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
- White, C. C., & Eldeib, H. K.
- Venue
- Operations Research
- Published
- 1994-08
- Volume
- 42
- Issue
- 4
- Pages
- 739-749
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2036931518
- Cited by
- 168
- References
- 0
- FWCI
- 1.45
- 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: Markov Decision Processes with Imprecise Transition Probabilities. https://app.cochat.ai/papers/10.1287/opre.42.4.739
- The paper
- White, C. C., & Eldeib, H. K. (1994). Markov Decision Processes with Imprecise Transition Probabilities. Operations Research. https://doi.org/10.1287/opre.42.4.739
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.