Table of Contents
Fetching ...

Cooperative Game-Theoretic Credit Assignment for Multi-Agent Policy Gradients via the Core

Mengda Ji, Genjiu Xu, Keke Jia, Zekun Duan, Yong Qiu, Jianjun Ge, Mingqiang Li

TL;DR

This work revisits the policy update process from a coalitional perspective and proposes CORA, an advantage allocation method guided by a cooperative game-theoretic core allocation that outperforms baselines and highlights the importance of coalition-level credit assignment and cooperative games for advancing multi-agent learning.

Abstract

This work focuses on the credit assignment problem in cooperative multi-agent reinforcement learning (MARL). Sharing the global advantage among agents often leads to insufficient policy optimization, as it fails to capture the coalitional contributions of different agents. In this work, we revisit the policy update process from a coalitional perspective and propose CORA, an advantage allocation method guided by a cooperative game-theoretic core allocation. By evaluating the marginal contributions of different coalitions and combining clipped double Q-learning to mitigate overestimation bias, CORA estimates coalition-wise advantages. The core formulation enforces coalition-wise lower bounds on allocated credits, so that coalitions with higher advantages receive stronger total incentives for their participating agents, enabling the global advantage to be attributed to different coalition strategies and promoting coordinated optimal behavior. To reduce computational overhead, we employ random coalition sampling to approximate the core allocation efficiently. Experiments on matrix games, differential games, and multi-agent collaboration benchmarks demonstrate that our method outperforms baselines. These findings highlight the importance of coalition-level credit assignment and cooperative games for advancing multi-agent learning.

Cooperative Game-Theoretic Credit Assignment for Multi-Agent Policy Gradients via the Core

TL;DR

This work revisits the policy update process from a coalitional perspective and proposes CORA, an advantage allocation method guided by a cooperative game-theoretic core allocation that outperforms baselines and highlights the importance of coalition-level credit assignment and cooperative games for advancing multi-agent learning.

Abstract

This work focuses on the credit assignment problem in cooperative multi-agent reinforcement learning (MARL). Sharing the global advantage among agents often leads to insufficient policy optimization, as it fails to capture the coalitional contributions of different agents. In this work, we revisit the policy update process from a coalitional perspective and propose CORA, an advantage allocation method guided by a cooperative game-theoretic core allocation. By evaluating the marginal contributions of different coalitions and combining clipped double Q-learning to mitigate overestimation bias, CORA estimates coalition-wise advantages. The core formulation enforces coalition-wise lower bounds on allocated credits, so that coalitions with higher advantages receive stronger total incentives for their participating agents, enabling the global advantage to be attributed to different coalition strategies and promoting coordinated optimal behavior. To reduce computational overhead, we employ random coalition sampling to approximate the core allocation efficiently. Experiments on matrix games, differential games, and multi-agent collaboration benchmarks demonstrate that our method outperforms baselines. These findings highlight the importance of coalition-level credit assignment and cooperative games for advancing multi-agent learning.

Paper Structure

This paper contains 26 sections, 10 theorems, 56 equations, 9 figures, 5 tables, 1 algorithm.

Key Result

Lemma 2

Assume $F_i$ is invertible. With $g_i=\mathbb E[\psi_i A_i]$, the NPG step eq:npg gives $\phi_i'-\phi_i=\alpha\,F_i^{-1}g_i=\alpha\,w_i^\star$.

Figures (9)

  • Figure 1: Overview of the CORA framework.
  • Figure 2: Training performance on Matrix Team Game and its Multi-Peak variants with 5, 10, and 15 reward peaks.
  • Figure 3: The reward and learning trajectories of various algorithms in the differential game scenario ($\mu$ in Gaussian strategy).
  • Figure 4: Training performance on the VMAS scenarios.
  • Figure 5: Performance comparison on Multi-Agent MuJoCo (MaMuJoCo-v5) scenarios.
  • ...and 4 more figures

Theorems & Definitions (19)

  • Definition 1: Compatible function approximation
  • Lemma 2
  • proof
  • Lemma 3
  • proof
  • Theorem 4
  • proof
  • Corollary 5
  • Remark 1
  • Theorem 6
  • ...and 9 more