AI Paper Atlas

Research map / Multi-agent systems and games / Cooperative multi-agent RL

Coordination graphs

Models agent interactions with sparse coordination graphs and search-based planning.

50 accepted papers at ICML, NeurIPS, ICLR, CVPR and AAAI (2016–2026) · an approach in Cooperative multi-agent RL, keyword cluster “decentralized · value · joint”

State History Tried Checklist Preprints Who Export

Where it stands

Not enough benchmark data Fewer than four papers report the same benchmark, so there is no record to follow.

10 papers in 2023–24 and 16 in 2025–26 (at ICML, NeurIPS, ICLR, CVPR and AAAI); its share of the topic held steady, from 7.1% to 7.0%.

How this is decided

A benchmark is tracked when at least four papers of this approach report their own method on the same dataset and metric in at least two different years. Its record is the best number reported up to 2024 compared with the best reported in 2025–26: still improving means at least 1% better, flat means at most 0.2% better with at least two papers from 2025–26 trying. Numbers on a different scale from the rest (a fraction among percentages) and far outliers are left out. Results come from different papers with different setups, so they are signals, not head-to-head comparisons. The share of papers is counted at ICML, NeurIPS, ICLR, CVPR and AAAI.

How it got here

2016: 2162017: 1172018: 2182019: 1192020: 6202021: 6212022: 6222023: 5232024: 5242025: 6252026: 1026

Most cited paper of each year

Earliest papers here

What has been tried

38 papers here report 346 measured changes (a component added, removed or swapped, compared with a baseline): helped 66%, no clear effect 9%, hurt 19%, mixed 5%. Papers mostly publish changes that helped, so "helped" is over-represented.

Ablations in recent papers

What was changedMeasured onResultEffectPaper
add meta-gradient guidance from the reward-shaping policy to the sparse-reward policyChengdu · average revenue vs training steps6×105HelpedGradient-Guided Credit Assignment and Joint Optimization for Dependency-Aware Spatial Crowdsourcing (AAAI 2025 · 3 citations)
add offline weighted particle filtering to FS-POMCPFireFightingGraph, Multi-Agent RockSample, CaptureTarget · returnHelpedFactored Online Planning in Many-Agent POMDPs (AAAI 2024 · 3 citations)
Remove Dynamic Node Generation (DNG)MatGame, medium and hard scenarios · rewardHurtMALinZero: Efficient Low-Dimensional Search for Mastering Complex Multi-Agent Planning (NeurIPS 2025 · 1 citation)
Use trajectory-class-aware coverage indexing J(t,k) instead of timestep-only J(t)SurComb4 · mean returnHelpedTrajectory-Class-Aware Multi-Agent Reinforcement Learning (ICLR 2025 · 0 citations)
Enforce non-negative pairwise utility instead of allowing negative pairwise utilityWolfpack and LBF; maximum of 5 and 9 agents · performanceHelpedOpen Ad Hoc Teamwork with Cooperative Game Theory (ICML 2024 · 0 citations)
replace the TrXL actor with a GTrXL actorNashville, 26 responders · average response time5 seconds higher than TrXLHurtMulti-Agent Reinforcement Learning with Hierarchical Coordination for Emergency Responder Stationing (ICML 2024 · 0 citations)
replace Max-Plus with Var-El for action selectionSysAdmin ring · average returnMixedScalable Safe Policy Improvement for Factored Multi-Agent MDPs (ICML 2024)

What reviewers will expect

Datasets and baselines named in the 9 papers of this approach from 2025–2026 that have a full-text summary. Leaving out the common ones is a frequent review question.

Baselines

  • QMIX · 2 of 9 papers

Recent preprints

Loading recent arXiv preprints…

    Who publishes on it

    Institutions on the most papers of this approach since 2023 (of 26 papers; from OpenAlex and the papers' affiliations).

    Use it

    Download BibTeX of 39 key papersOpen the topic in the interactive map

    Get alerts. Describe your idea in scime atlas and save it (free scime account): you get a weekly email when new preprints land close to it.

    Same keyword cluster

    Elsewhere in the topic

    Benchmark numbers, ablations and baseline numbers are extracted by AI from each paper's full text and can be wrong; the paper is the authority. Data: results index of 2026-11-02, citation counts from OpenAlex (2026-10-09).

    Get the next scime Dispatch and a monthly field update

    Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy