Pith. sign in

REVIEW 2 cited by

An Initial Introduction to Cooperative Multi-Agent Reinforcement Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.06161 v5 pith:OSUN35YH submitted 2024-05-10 cs.LG cs.MA

classification cs.LGcs.MA
keywords methodsexecutiontrainingcentralizeddecentralizedduringmarlapproaches
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Multi-agent reinforcement learning (MARL) has exploded in popularity in recent years. While numerous approaches have been developed, they can be broadly categorized into three main types: centralized training and execution (CTE), centralized training for decentralized execution (CTDE), and decentralized training and execution (DTE). CTE methods assume centralization during training and execution (e.g., with fast, free, and perfect communication) and have the most information during execution. CTDE methods are the most common, as they leverage centralized information during training while enabling decentralized execution -- using only information available to that agent during execution. Decentralized training and execution methods make the fewest assumptions and are often simple to implement. This text is an introduction to cooperative MARL -- MARL in which all agents share a single, joint reward. It is meant to explain the setting, basic concepts, and common methods for the CTE, CTDE, and DTE settings. It does not cover all work in cooperative MARL as the area is quite extensive. I have included work that I believe is important for understanding the main concepts in the area and apologize to those that I have omitted. Topics include simple applications of single-agent methods to CTE as well as some more scalable methods that exploit the multi-agent structure, independent Q-learning and policy gradient methods and their extensions, as well as value function factorization methods including the well-known VDN, QMIX, and QPLEX approaches, and centralized critic methods including MADDPG, COMA, and MAPPO. I also discuss common misconceptions, the relationship between different approaches, and some open questions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. ACPO: Agent-Chained Policy Optimization for Multi-Agent Reinforcement Learning

    cs.AI 2026-06 unverdicted novelty 7.0 of 10

    ACPO decomposes the joint policy gradient into per-agent terms allowing independent actor training that collectively forms a joint gradient step in CTDE-based MARL.

  2. Federated Physics-Grounded Reinforcement Learning for Distributed Stability Control in Smart Grids

    cs.LG 2026-07 conditional novelty 6.0 of 10

    On IEEE 39-bus simulations, federated multi-agent PPO with physics-grounded neighbor observations stabilizes all tested faults 72% faster and with 7–14× less control power than centralized feedback linearization, with...

Pith tools