Papers › Learning when to Communicate at Scale in Multiagent Cooperative and Competitive Tasks

Learning when to Communicate at Scale in Multiagent Cooperative and Competitive Tasks

23 Dec 2018ICLR 2019 5arXiv:1812.09755archive 2025-07-28

Amanpreet Singh, Tushar Jain, Sainbayar Sukhbaatar

Learning when to communicate and doing that effectively is essential in multi-agent tasks. Recent works show that continuous communication allows efficient training with back-propagation in multi-agent scenarios, but have been restricted to fully-cooperative tasks. In this paper, we present Individualized Controlled Continuous Communication Model (IC3Net) which has better training efficiency than simple continuous communication model, and can be applied to semi-cooperative and competitive settings along with the cooperative settings. IC3Net controls continuous communication with a gating mechanism and uses individualized rewards foreach agent to gain better performance and scalability while fixing credit assignment issues. Using variety of tasks including StarCraft BroodWars explore and combat scenarios, we show that our network yields improved performance and convergence rates than the baselines as the scale increases. Our results convey that IC3Net agents learn when to communicate based on the scenario and profitability.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1812.09755")

Code

Syntology Ran 1 of 11 code samples harvested from 3 repositories linked to this paper; 10 have no recorded run. Of those that ran: 1 ran · honoured contract.

By repository: official repository: 7 samples from 1 repository, 0 ran; community (archive-listed): 4 samples from 2 repositories, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

IC3Net/IC3Net officialmentioned in papermentioned on GitHubpytorchMIT report
RL-WFU/IC3Net-Highway mentioned on GitHubpytorch report
apsdehal/gym-starcraft mentioned on GitHubMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 1 ran; 1 honoured the contract we drafted; 10 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
10unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 3 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

get_add_mat IC3Net/IC3Net/ic3net-envs/ic3net_envs/traffic_helper.py official repository unverified MIT (permissive) · 66f904cd49b5f2bb · report
get_road_blocks IC3Net/IC3Net/ic3net-envs/ic3net_envs/traffic_helper.py official repository unverified MIT (permissive) · 4a6659e981dad238 · report
goal_reached IC3Net/IC3Net/ic3net-envs/ic3net_envs/traffic_helper.py official repository unverified MIT (permissive) · 2c15fd3b782cb39c · report
init IC3Net/IC3Net/data.py official repository unverified MIT (permissive) · 8cab58f1257e1400 · report
read_file IC3Net/IC3Net/plot_script.py official repository unverified MIT (permissive) · a9fef680e2912a66 · report
select_action IC3Net/IC3Net/action_utils.py official repository unverified MIT (permissive) · dbf148c04f6bc762 · report
translate_action IC3Net/IC3Net/action_utils.py official repository unverified MIT (permissive) · 420dd86fe5989706 · report
nPr RL-WFU/IC3Net-Highway/ic3net-envs/ic3net_envs/traffic_junction_env.py community (archive-listed) ran · honoured contract fingerprinted MIT (permissive) · 37a75d30add374c0 · report
get_closest apsdehal/gym-starcraft/gym_starcraft/utils.py community (archive-listed) unverified MIT (permissive) · b0f41d218fa1d86d · report
get_distance apsdehal/gym-starcraft/gym_starcraft/utils.py community (archive-listed) unverified MIT (permissive) · 4cae8240fd6f06df · report
get_weakest apsdehal/gym-starcraft/gym_starcraft/utils.py community (archive-listed) unverified MIT (permissive) · 203cd54da11b7d04 · report

Tasks

Starcraft

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections