A sparse action dependency graph derived from the coordination graph is sufficient for a locally optimal policy to be globally optimal in cooperative multi-agent RL.
Revisiting some common practices in cooperative multi-agent reinforcement learning
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Action Dependency Graphs for Globally Optimal Coordinated Reinforcement Learning
A sparse action dependency graph derived from the coordination graph is sufficient for a locally optimal policy to be globally optimal in cooperative multi-agent RL.