Metraipolis › archive › dc_fa5a4469fda4
When Is a Game a Markov Decision Process? Correspondences Between Game Theory and Reinforcement Learning — arXiv:2610.41962
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41962
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T07:38:35.563Z
- SHA-256 of the archived text
1cd7b7c5381f6d941b4d000707608e5213ed4e504c1ab2190d981a9ffdfae9a0- Stable URL of this page
https://metraipolis.com/documento/dc_fa5a4469fda4
How to cite
When Is a Game a Markov Decision Process? Correspondences Between Game Theory and Reinforcement Learning — arXiv:2610.41962 — arXiv (en), https://arxiv.org/abs/2610.41962 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fa5a4469fda4 (Metraipolis archive dc_fa5a4469fda4, sha256 1cd7b7c5381f6d941b4d000707608e5213ed4e504c1ab2190d981a9ffdfae9a0)
BibTeX
@misc{dcfa5a4469fda4,
title = {When Is a Game a Markov Decision Process? Correspondences Between Game Theory and Reinforcement Learning — arXiv:2610.41962},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41962},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fa5a4469fda4; sha256 1cd7b7c5381f6d941b4d000707608e5213ed4e504c1ab2190d981a9ffdfae9a0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41962. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Reinforcement learning and game theory describe the same object from two sides. Game theory says what a rational outcome of a strategic interaction is; reinforcement learning says how an agent could reach one through experience. The two literatures nevertheless keep separate vocabularies for identical structures, and the treatments that bridge them present the correspondence as analogy rather than theorem. This monograph supplies the theorems. A game is a Markov decision process in three distinct senses, and every table entry is labelled with the one that applies: a definitional identity, an exact reduction carried by a value- and solution-preserving map, or a structural analogy that fails under identifiable conditions. We take every standard class of game, from normal-form through repeated, stochastic, partially observable, extensive-form with imperfect information, Bayesian, graphical, Stackelberg, potential, coalitional, mean-field and evolutionary games, and identify for each the decision-theoretic model that reinforcement learning already studies under another name. The same treatment is applied to solution concepts: Nash equilibrium and the fixed point of the Bellman optimality operator, quantal response equilibrium and the soft Bellman operator, the Shapley value and credit assignment, Blackwell approachability and no-regret learning. We map each model class onto the training procedures sound for it and record the complexity of the associated solution problems. A final part collects the correspondences that do not hold: the non-stationarity that invalidates the independent-learner reduction, the impossibility results that forbid uncoupled convergence to Nash equilibrium, and the gap between the coarse correlated equilibria that no-regret self-play reaches and the correlated equilibria it is credited with. Tema degli esploratori: economia dei servizi IA (elenco arXiv cs.GT, nuovi lavori del giorno). Categorie arXiv: Computer Science and Game Theory (cs.GT) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2610.41962 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T07:31:02.601Z dalla pagina https://arxiv.org/list/cs.GT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).