Pith. sign in

REVIEW 3 cited by

Deep Implicit Coordination Graphs for 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 2006.11438 v2 pith:SJ4SP7F2 submitted 2020-06-19 cs.LG cs.AIcs.MA

classification cs.LGcs.AIcs.MA
keywords coordinationdicggraphjointlearningmulti-agentactionallows
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Multi-agent reinforcement learning (MARL) requires coordination to efficiently solve certain tasks. Fully centralized control is often infeasible in such domains due to the size of joint action spaces. Coordination graph based formalization allows reasoning about the joint action based on the structure of interactions. However, they often require domain expertise in their design. This paper introduces the deep implicit coordination graph (DICG) architecture for such scenarios. DICG consists of a module for inferring the dynamic coordination graph structure which is then used by a graph neural network based module to learn to implicitly reason about the joint actions or values. DICG allows learning the tradeoff between full centralization and decentralization via standard actor-critic methods to significantly improve coordination for domains with large number of agents. We apply DICG to both centralized-training-centralized-execution and centralized-training-decentralized-execution regimes. We demonstrate that DICG solves the relative overgeneralization pathology in predatory-prey tasks as well as outperforms various MARL baselines on the challenging StarCraft II Multi-agent Challenge (SMAC) and traffic junction environments.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. PLATO: Pointer Learner for Agent and Task Openness

    cs.AI 2026-07 conditional novelty 6.0 of 10

    A pointer-network actor plus GNN critic jointly handles agent and task openness in MARL without fixed bounds, with proofs of well-definedness and strong wildfire results.

  2. Long-Term Mapping of the Douro River Plume with Multi-Agent Reinforcement Learning

    cs.MA 2025-10 conditional novelty 5.0 of 10

    Multi-agent deep Q-learning with spatiotemporal Gaussian process regression yields energy-aware multi-day mapping of the Douro plume in simulation, beating several baselines but not on every test month.

  3. Toward Edge General Intelligence with Agentic AI and Agentification: Concepts, Technologies, and Future Directions

    cs.NI 2025-08 conditional novelty 4.0 of 10

    A survey that organizes agentic AI for 6G edge networks into four pillars, compactness, efficiency, knowledge and reasoning, and migration, and illustrates them with prior case studies.

Pith tools