Partially Observable Mean Field Reinforcement Learning

Abstract

Traditional multi-agent reinforcement learning algorithms are not scalable to environments with more than a few agents, since these algorithms are exponential in the number of agents. Recent research has introduced successful methods to scale multi-agent reinforcement learning algorithms to many agent scenarios using mean field theory. Previous work in this field assumes that an agent has access to exact cumulative metrics regarding the mean field behaviour of the system, which it can then use to take its actions. In this paper, we relax this assumption and maintain a distribution to model the uncertainty regarding the mean field of the system. We consider two different settings for this problem. In the first setting, only agents in a fixed neighbourhood are visible, while in the second setting, the visibility of agents is determined at random based on distances. For each of these settings, we introduce a Q-learning based algorithm that can learn effectively. We prove that this Q-learn

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keysubramanian2020partially

Related papers

• Mean Field Multi-agent Reinforcement Learning (2018)2.26
• Partially Observable Mean Field Multi-agent Reinforcement Learning Based On Graph-attention (2023)9.76
• Decentralized Mean Field Games (2021)3.58
• Multi Type Mean Field Reinforcement Learning (2020)0.00
• Causal Mean Field Multi-agent Reinforcement Learning (2025)2.26
• Efficient Model-based Multi-agent Mean-field Reinforcement Learning (2021)0.00
• Model-free Mean-field Reinforcement Learning: Mean-field MDP And Mean-field Q-learning (2019)0.00
• Breaking The Curse Of Many Agents: Provable Mean Embedding Q-iteration For Mean-field Reinforcement Learning (2020)0.00