Optimal Solutions to Infinite-Player Stochastic Teams and Mean-Field Teams
Not on the map. Why?
Abstract (arXiv)
We study stochastic static teams with countably infinite number of decision makers, with the goal of obtaining (globally) optimal policies under a decentralized information structure. We present sufficient conditions to connect the concepts of team optimality and person by person optimality for static teams with countably infinite number of decision makers. We show that under uniform integrability and uniform convergence conditions, an optimal policy for static teams with countably infinite number of decision makers can be established as the limit of sequences of optimal policies for static teams with N decision makers as N → ∞. Under the presence of a symmetry condition, we relax the conditions and this leads to optimality results for a large class of mean-field optimal team problems where the existing results have been limited to person-by-person-optimality and not global optimality (under strict decentralization). In particular, we establish the optimality of symmetric (i.e., identical) policies for such problems. As a further condition, this optimality result leads to an existence result for mean-field teams. We consider a number of illustrative examples where the theory is applied to setups with either infinitely many decision makers or an infinite-horizon stochastic control problem reduced to a static team.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 8 Aug 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 1; 2024: 0; 2025: 0; 2026: 1.
4 papers.
- 2021Satisficing Paths and Independent Multi-Agent Reinforcement Learning in Stochastic Gamescited by 9
- 2023Major-Minor Mean Field Multi-Agent Reinforcement Learningcited by 4
- 2021Learning distributed channel access policies for networked estimation: data-driven optimization in the mean-field regimecited by 0
- 2026Robust Q-learning for mean-field control under Wasserstein uncertainty in common noisecited by 0
- 2026Robust Q-learning for mean-field control under Wasserstein uncertainty in common noise18 Jun 2026
- 2023Major-Minor Mean Field Multi-Agent Reinforcement Learning19 Mar 2023
- 2021Learning distributed channel access policies for networked estimation: data-driven optimization in the mean-field regime10 Dec 2021
- 2021Satisficing Paths and Independent Multi-Agent Reinforcement Learning in Stochastic Games9 Oct 2021