SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2511.02304 · ICML · 2025

Automata-Conditioned Cooperative Multi-Agent Reinforcement Learning

Ameesh Shah, Marcell Vazquez-Chanlatte, Sanjit Seshia, Beyazit Yalcinkaya, Hanna Krasowski

arXiv · PDF · Open in the Atlas

Code that ran

1 of 2 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 1 no recorded run), measured 2026-11-22; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2511.02304.json · badge: /api/ran/2511.02304.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
rad-dfa/acc-marl community
Papers with Code archive
1 ran · 1 no recorded run
FunctionStatusWhere it lives
make_train Ran
ran; our contract draft was wrong, not the code
rad-dfa/acc-marl/acc_marl/train_recurrent_policy.py
pointer only (licence: NOASSERTION) · get_code("ecfc6590cfcf6338")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, rad-dfa/acc-marl (NOASSERTION). The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

Transition Not yet run
unverified (harvested, no recorded run)
rad-dfa/acc-marl/acc_marl/train_recurrent_policy.py
pointer only (licence: NOASSERTION) · get_code("0a52c00ef0bcc3f3")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, rad-dfa/acc-marl (NOASSERTION). The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 2 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

We study learning multi-task, multi-agent policies for cooperative, temporal objectives, under centralized training, decentralized execution. In this setting, using automata to represent tasks assigned to agents enables breaking down a teamlevel objective into simpler, smaller sub-tasks. However, existing approaches remain sampleinefficient and are limited to the single-task case, requiring retraining policies for each new task. In this work, we present Automata-Conditioned Cooperative Multi-Agent Reinforcement Learning (ACC-MARL), a framework for learning taskconditioned, decentralized team policies. We identify challenges to the feasibility of ACC-MARL, propose solutions, and prove that our approach is optimal. We further show that learned value functions can be used to assign tasks optimally at test time. Experiments demonstrate emergent task-aware, multi-step coordination among agents, such as pressing a button to unlock a door, holding the door, and short-circuiting tasks. Our code is available at https://github.com/rad-dfa/acc-marl.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2511.02304")
get_code_for_paper("2511.02304")
have("2511.02304")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2511.02304.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2511.02304.svg)](https://syntology.ai/paper/2511.02304)

Connect an agent — have() is free.