Approximate Nash Equilibria in Partially Observed Stochastic Games with Mean-Field Interactions
Not on the map. Why?
Abstract (arXiv)
Establishing the existence of Nash equilibria for partially observed stochastic dynamic games is known to be quite challenging, with the difficulties stemming from the noisy nature of the measurements available to individual players (agents) and the decentralized nature of this information. When the number of players is sufficiently large and the interactions among agents is of the mean-field type, one way to overcome this challenge is to investigate the infinite-population limit of the problem, which leads to a mean-field game. In this paper, we consider discrete-time partially observed mean-field games with infinite-horizon discounted cost criteria. Using the technique of converting the original partially observed stochastic control problem to a fully observed one on the belief space and the dynamic programming principle, we establish the existence of Nash equilibria for these game models under very mild technical conditions. Then, we show that the mean-field equilibrium policy, when adopted by each agent, forms an approximate Nash equilibrium for games with sufficiently many agents.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 May 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 0; 2024: 2; 2025: 0; 2026: 2.
8 papers.
- 2021Approximately Solving Mean Field Games via Entropy-Regularized Deep Reinforcement Learningcited by 65
- 2021Learning Graphon Mean Field Games and Approximate Nash Equilibriacited by 28
- 2022A Survey on Large-Population Systems and Scalable Multi-Agent Reinforcement Learningcited by 12
- 2021Discrete-Time Mean Field Control with Environment Statescited by 7
- 2024Unified continuous-time q-learning for mean-field game and mean-field control problemscited by 7
- 2024On Diffusion Models for Multi-Agent Partial Observability: Shared Attractors, Error Bounds, and Composite Flowcited by 5
- 2026Recurrent Structural Policy Gradient for Partially Observable Mean Field Gamescited by 0
- 2026Stationary Robust Mean-Field Games under Model Mismatchescited by 0
- 2026Stationary Robust Mean-Field Games under Model Mismatches21 Jun 2026
- 2026Recurrent Structural Policy Gradient for Partially Observable Mean Field Games23 Feb 2026
- 2024On Diffusion Models for Multi-Agent Partial Observability: Shared Attractors, Error Bounds, and Composite Flow17 Oct 2024
- 2024Unified continuous-time q-learning for mean-field game and mean-field control problems5 Jul 2024
- 2022A Survey on Large-Population Systems and Scalable Multi-Agent Reinforcement Learning8 Sep 2022
- 2021Learning Graphon Mean Field Games and Approximate Nash Equilibria29 Nov 2021
- 2021Discrete-Time Mean Field Control with Environment States30 Apr 2021
- 2021Approximately Solving Mean Field Games via Entropy-Regularized Deep Reinforcement Learning2 Feb 2021