CG-CMARL decomposes constrained multi-agent RL into pairwise coordination graphs with shared Q-functions, using Max-Sum message passing and a Lagrangian multiplier to coordinate actions and trace Pareto fronts scalably.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Coordination Graphs for Constrained Multi-Agent Reinforcement Learning
CG-CMARL decomposes constrained multi-agent RL into pairwise coordination graphs with shared Q-functions, using Max-Sum message passing and a Lagrangian multiplier to coordinate actions and trace Pareto fronts scalably.