The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Decentralized learning of Nash equilibria in multi-person stochastic games with incomplete information
Abstract
A multi-person discrete game where the payoff after each play is stochastic is considered. The distribution of the random payoff is unknown to the players and further none of the players know the strategies or the actual moves of other players. A learning algorithm for the game based on a decentralized team of learning automata is presented. It is proved that all stable stationary points of the algorithm are Nash equilibria for the game. Two special cases of the game are also discussed, namely, game with common payoff and the relaxation labelling problem. The former has applications such as pattern recognition and the latter is a problem widely studied in computer vision. For the two special cases it is shown that the algorithm always converges to a desirable solution.>
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
Convergence of Probability Measures
Billingsley, P. (1999) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316962 · Cited by 13,910
Convergence of Probability Measures
Kingman, J. F. C., & Billingsley, P. (1969) · Revue de l'Institut International de Statistique / Review of the International Statistical Institute · doi:10.2307/1402124 · Cited by 6,812
Dynamic Noncooperative Game Theory
(1982) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6169-7 · Cited by 4,057
Narendra, K. S., & Annaswamy, A. M. (1989) · Cited by 3,988
Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
Harsanyi, J. C. (1967) · Management Science · doi:10.1287/mnsc.14.3.159 · Cited by 2,147
Adaptive Algorithms and Stochastic Approximations
Benveniste, A., Métivier, M., & Priouret, P. (1990) · Springer eBooks · doi:10.1007/978-3-642-75894-2 · Cited by 2,006
Learning Automata: An Introduction
Narendra, K. S., & Thathachar, M. A. L. (1989) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,540
Self-citationOn the Foundations of Relaxation Labeling Processes
Hummel, R. A., & Zucker, S. W. (1983) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1983.4767390 · Cited by 885
Oligopoly and the Theory of Games.
Binmore, K. G., & Friedman, J. W. (1978) · Economica · doi:10.2307/2553264 · Cited by 740
Distributed algorithms for the computation of noncooperative equilibria
Li, S., & Başar, T. (1987) · Automatica · doi:10.1016/0005-1098(87)90081-1 · Cited by 192
Cited by
Cognitive internet of things: A new paradigm beyond connection
Wu, Q., Ding, G., Xu, Y., Feng, S., Du, Z., Wang, J., & Long, K. (2014) · IEEE Internet of Things Journal · doi:10.1109/jiot.2014.2311513 · Cited by 550
Dynamic Spectrum Access with QoS and Interference Temperature Constraints
Xing, Y., Mathur, C. N., Haleem, M. A., Chandramouli, R., & Subbalakshmi, K. P. (2007) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2007.50 · Cited by 461
Xu, Y., Wang, J., Wu, Q., Anpalagan, A., & Yao, Y.-D. (2012) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2012.020812.110025 · Cited by 280
Metadata
- Authors
- Sastry, P. S., Phansalkar, V. V., & Thathachar, M. A. L.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1994-05
- Volume
- 24
- Issue
- 5
- Pages
- 769-777
- ISSN
- 0018-9472 (ISSN-L)
- OpenAlex
- W2169194711
- Cited by
- 320
- References
- 15
- FWCI
- 3.25
- 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: Decentralized learning of Nash equilibria in multi-person stochastic games with incomplete information. https://app.cochat.ai/papers/10.1109/21.293490
- The paper
- Sastry, P. S., Phansalkar, V. V., & Thathachar, M. A. L. (1994). Decentralized learning of Nash equilibria in multi-person stochastic games with incomplete information. IEEE Transactions on Systems, Man, and Cybernetics. https://doi.org/10.1109/21.293490
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.