Fictitious Play and Best-Response Dynamics in Identical Interest and Zero-Sum Stochastic Games
Lucas Baudin, Rida Laraki
Abstract
This paper proposes an extension of a popular decentralized discrete-time learning procedure when repeating a static game called fictitious play (FP) (Brown, 1951; Robinson, 1951) to a dynamic model called discounted stochastic game (Shapley, 1953) . Our family of discretetime FP procedures is proven to converge to the set of stationary Nash equilibria in identical interest discounted stochastic games. This extends similar convergence results for static games (Monderer & Shapley, 1996a). We then analyze the continuous-time counterpart of our FP procedures, which include as a particular case the best-response dynamic introduced and studied by Leslie et al. (2020) in the context of zero-sum stochastic games. We prove the converge of this dynamics to stationary Nash equilibria in identical-interest and zero-sum discounted stochastic games. Thanks to stochastic approximations, we can infer from the continuous-time convergence some discrete time results such as the convergence to stationary equilibria in zero sum and team stochastic games (Holler, 2020) .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 793554ec-3c19-4a57-b7c0-85970801b182Cited by top-tier papers6
- A Finite-Sample Analysis of Payoff-Based Independent Learning in Zero-Sum Stochastic GamesZaiwei Chen, Kaiqing Zhang, Eric Mazumdar, Asuman E. Ozdaglar et al.NeurIPS 2023 · 22 citations
- Multi-Player Zero-Sum Markov Games with Networked Separable InteractionsChanwoo Park, Kaiqing Zhang, Asuman E. OzdaglarNeurIPS 2023 · 17 citations
- Smooth Fictitious Play in Stochastic Games with Perturbed Payoffs and Unknown TransitionsLucas Baudin, Rida LarakiNeurIPS 2022 · 8 citations
- Optimism Without Regularization: Constant Regret in Zero-Sum GamesJohn Lazarsfeld, Georgios Piliouras, Ryann Sim, Stratis SkoulakisNeurIPS 2025 · 7 citations
- Paths to Equilibrium in GamesBora Yongacoglu, Gürdal Arslan, Lacra Pavel, Serdar YükselNeurIPS 2024 · 2 citations
Builds on5
- Conservative Q-Learning for Offline Reinforcement LearningAviral Kumar, Aurick Zhou, George Tucker, Sergey LevineNeurIPS 2020 · 2,881 citations
- Fictitious Play for Mean Field Games: Continuous Time Analysis and ApplicationsSarah Perrin, Julien Pérolat, Mathieu Laurière, Matthieu Geist et al.NeurIPS 2020 · 150 citations
- Decentralized Q-learning in Zero-sum Markov GamesMuhammed O. Sayin, Kaiqing Zhang, David S. Leslie, Tamer Basar et al.NeurIPS 2021 · 105 citations
- Can Q-Learning with Graph Networks Learn a Generalizable Branching Heuristic for a SAT Solver?Vitaly Kurin, Saad Godil, Shimon Whiteson, Bryan CatanzaroNeurIPS 2020 · 77 citations
- The complexity of constrained min-max optimizationConstantinos Daskalakis, Stratis Skoulakis, Manolis ZampetakisSTOC 2021 · 18 citations
Related papers
- Exponential Lower Bounds for Fictitious Play in Potential GamesIoannis Panageas, Nikolas Patris, Stratis Skoulakis, Volkan CevherNeurIPS 2023 · 1 citation
- Team-Fictitious Play for Reaching Team-Nash Equilibrium in Multi-team GamesAhmed Said Donmez, Yuksel Arslantas, Muhammed Omer SayinNeurIPS 2024 · 2 citations
- Fast Convergence of Fictitious Play for Diagonal Payoff MatricesJacob D. Abernethy, Kevin A. Lai, Andre WibisonoSODA 2021
- Towards convergence to Nash equilibria in two-team zero-sum gamesFivos Kalogiannis, Ioannis Panageas, Emmanouil V. Vlatakis-GkaragkounisICLR 2023
- Learning While Playing in Mean-Field Games: Convergence and OptimalityQiaomin Xie, Zhuoran Yang, Zhaoran Wang, Andreea MincaICML 2021 · 45 citations
