atlas

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

Learning to Communicate Through Implicit Communication Channels

ICLR 2025 · Multi-agent systems and games › Cooperative multi-agent RL · approach: Learned inter-agent communication · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes the Implicit Channel Protocol (ICP), which encodes messages into designated "scouting" actions that act as an implicit communication channel, and trains agents with a random initial or delayed information map, reaching 24.91/25 in Hanabi.

Problem

Communication in collaborative multi-agent RL when explicit messaging channels are unavailable; existing implicit communication relies on theory-of-mind inference, which is computationally costly and inaccurate in complex tasks.

Approach

Designate a subset of actions (scouting actions) with no or uniform effect on environment dynamics as an implicit channel, use a shared centralized mapping from messages to these actions so receivers decode intent directly without ToM inference, and train with either a randomly initialized map (DIAL-style Gumbel-Softmax gradients) or a delayed map (pre-train on explicit channel, then transfer).

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use ICP with hat mapping instead of the SAD baselineHanabi 4-player full version · Hanabiaverage score: 23.81 -> 24.91Helped
Use ICP instead of the SAD baselineHanabi 4-player full version · Hanabiwin rate: 41.45% -> 91%Helped
Use ICP instead of ToM-based methodsHanabi 4-player full version · Hanabiaverage score: 19.13 -> 24.91Helped
Use ICP instead of average human playHanabi 4-player full version · Hanabiaverage score: 17 -> 24.91Helped
Use the random-initial-map ICP strategy instead of VDN baselinesGuessing Numbers · Guessing Numbersaverage episode length: around 12.4 -> approximately 8.63Helped
Use the random-initial-map ICP strategy instead of the baselinesRevealing Goals · Revealing Goalsaverage score: 2.17 timesHelped
Use hat mapping rather than the other tested ICP variants (ablation)Hanabi ICP · Hanabi 4-player full versionaverage scoreHelped
Shuffle the embedding while keeping the information strategy fixed, then fine-tune the action policy (ablation)ICN-RGMComm-hat-mapping policy · HanabiperformanceMixed

Surprising findings

Limitations

Experimental setup

Datasets: Guessing Numbers (self-designed environment) Revealing Goals (self-designed environment) Hanabi

Benchmarks: Guessing Numbers Revealing Goals Hanabi

Metrics: average score average episode length win rate

Baselines: VDN-on-policy VDN-off-policy DIAL-Cheat SAD WTFWThat+search Theory of mind-based methods

Builds on: DIAL VDN RGMComm SAD Hat guessing game hat mapping

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

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