The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
An Analysis of Stochastic Shortest Path Problems
Open accessAbstract
We consider a stochastic version of the classical shortest path problem whereby for each node of a graph, we must choose a probability distribution over the set of successor nodes so as to reach a certain destination node with minimum expected cost. The costs of transition between successive nodes can be positive as well as negative. We prove natural generalizations of the standard results for the deterministic shortest path problem, and we extend the corresponding theory for undiscounted finite state Markovian decision problems by removing the usual restriction that costs are either all nonnegative or all nonpositive.
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
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Self-citationStochastic optimal control : the discrete time case
Bertsekas, D. P., & Shreve, S. E. (2007) · Cited by 1,654
Self-citationDynamic Programming: Deterministic and Stochastic Models
Bertsekas, D. P. (1987) · Medical Entomology and Zoology · Cited by 1,325
Self-citationKirk, D. E. (1970) · Cited by 910
Finite State Markovian Decision Processes
Derman, C. (1970) · Cited by 853
Contraction Mappings in the Theory Underlying Dynamic Programming
Denardo, E. V. (1967) · SIAM Review · doi:10.1137/1009030 · Cited by 456
Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
Veinott, A. F. (1969) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697379 · Cited by 248
Solving H-horizon, stationary Markov decision problems in time proportional to log(H)
Tseng, P. (1990) · Operations Research Letters · doi:10.1016/0167-6377(90)90022-w · Cited by 79
Cited by
A Comprehensive Network Security Risk Model for Process Control Networks
Henry, M. H., & Haimes, Y. Y. (2009) · Risk Analysis · doi:10.1111/j.1539-6924.2008.01151.x · Cited by 42
Towards explainable multi-objective probabilistic planning
Sukkerd, R., Simmons, R., & Garlan, D. (2018) · Proceedings of the 4th International Workshop on Software Engineering for Smart Cyber-Physical Systems · doi:10.1145/3196478.3196488 · Cited by 27
On Solving a Stochastic Shortest-Path Markov Decision Process as Probabilistic Inference
Baioumy, M., Lacerda, B., Duckworth, P., & Hawes, N. (2021) · Communications in Computer and Information Science · doi:10.1007/978-3-030-93736-2_58 · Cited by 4
Survey of Computerized Adaptive Testing: A Machine Learning Perspective
Zhuang, Y., Liu, Q., Bi, H., Huang, Z., Huang, W., Li, J., Yu, J., Liu, Z., Hu, Z., Hong, Y., et al. (2026) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2026.3672850 · Cited by 9
“These datasets are useful for validating the CAT system’s capability to estimate proficiencies accurately and to adapt to the simulated changes during the testing process.”
Metadata
- Authors
- Bertsekas, D. P., & Tsitsiklis, J. N.
- Venue
- Mathematics of Operations Research
- Published
- 1991-08
- Volume
- 16
- Issue
- 3
- Pages
- 580-595
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2081287319
- Cited by
- 488
- References
- 8
- FWCI
- 1.89
- Type
- journal article
- Language
- en
- Open access
- green
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: An Analysis of Stochastic Shortest Path Problems. https://app.cochat.ai/papers/10.1287/moor.16.3.580
- The paper
- Bertsekas, D. P., & Tsitsiklis, J. N. (1991). An Analysis of Stochastic Shortest Path Problems. Mathematics of Operations Research. https://doi.org/10.1287/moor.16.3.580
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.
