The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
On Nonterminating Stochastic Games
Abstract
A stochastic game is played in a sequence of steps; at each step the play is said to be in some state i, chosen from a finite collection of states. If the play is in state i, the first player chooses move k and the second player chooses move l, then the first player receives a reward a kli, and, with probability p klij, the next state is j. The concept of stochastic games was introduced by Shapley with the proviso that, with probability 1, play terminates. The authors consider the case when play never terminates, and show properties of such games and offer a convergent algorithm for their solution. In the special case when one of the players is a dummy, the nonterminating stochastic game reduces to a Markovian decision process, and the present work can be regarded as the extension to a game theoretic context of known results on Markovian decision processes.
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
Dynamic Programming and Markov Processes.
Freimer, M., & Howard, R. A. (1961) · Journal of the American Statistical Association · doi:10.2307/2282268 · Cited by 3,378
Shapley, L. S. (1953) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.39.10.1095 · Cited by 2,382
Contributions to the theory of games.
(1960) · Journal of the Franklin Institute · doi:10.1016/0016-0032(60)90366-5 · Cited by 1,824
11. Extensive Games and the Problem of Information
Kuhn, H. W. (1953) · Contributions to the Theory of Games (AM-28), Volume II · doi:10.1515/9781400881970-012 · Cited by 913
Linear Programming and Sequential Decisions
Manne, A. S. (1960) · Management Science · doi:10.1287/mnsc.6.3.259 · Cited by 437
28. Mixed and Behavior Strategies in Infinite Extensive Games
Aumann, R. J. (1964) · Princeton University Press eBooks · doi:10.1515/9781400882014-029 · Cited by 217
9. STOCHASTIC GAMES WITH ZERO STOP PROBABILITIES
Gillette, D. (1958) · Contributions to the Theory of Games (AM-39), Volume III · doi:10.1515/9781400882151-011 · Cited by 204
A Probabilistic Production and Inventory Problem
d'Epenoux, F. (1963) · Management Science · doi:10.1287/mnsc.10.1.98 · Cited by 201
Cited by
Reinforcement Learning: A Survey
Kaelbling, L. P., Littman, M. L., & Moore, A. W. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.301 · Cited by 8,972
Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms
Zhang, K., Yang, Z., & Başar, T. (2021) · Studies in Systems, Decision and Control · doi:10.1007/978-3-030-60990-0_12 · Cited by 1,264
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303765208377 · Cited by 467
Action robust reinforcement learning and applications in continuous control
Tessler, C., Efroni, Y., & Mannor, S. (2019) · arXiv · doi:10.48550/arxiv.1901.09184 · Cited by 108
Metadata
- Authors
- Hoffman, A. J., & Karp, R. M.
- Venue
- Management Science
- Published
- 1966-01
- Volume
- 12
- Issue
- 5
- Pages
- 359-370
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2156268532
- Cited by
- 258
- References
- 8
- FWCI
- 4.31
- 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.