arXiv AI

Centralized Critics for N-Agent Ad Hoc Teamwork

The paper investigates how to design centralized critics for N-agent ad hoc teamwork, where a learning agent must coordinate with an unknown set of uncontrolled teammates. It compares two advantage estimators: controlled history estimators that use only the learner’s own histories, and joint history estimators that also incorporate the uncontrolled teammates’ histories. The authors prove both estimators are unbiased, show conditions where joint history estimators have lower variance, and demonstrate empirically that joint history critics achieve better sample efficiency and final returns across various NAHT tasks.

arXiv Machine Learning
Oct 5

Turnover-Orthogonal Credit Assignment for Open-Team Multi-Agent Reinforcement Learning

The paper introduces Turnover-Orthogonal Credit Assignment (TOCA), a method for open-team multi-agent reinforcement learning that separates the effects of agent actions, pure turnover, and action–turnover interactions in the team return. TOCA uses a permutation‑invariant centralized critic with event tokens to provide counterfactual per‑agent credit signals and a softly weighted interaction variant, TOCA‑β, for high‑variance environments. Experiments show that TOCA outperforms event‑aware MAPPO critics and that removing interaction credit degrades performance, especially in high‑turnover settings such as the Dynamic Spread benchmark.

By Amit Thakur, Mukesh Singhal
arXiv AI
Oct 9

Constrained Command-Conditioned Reinforcement Learning with Bandit Strategy Selection in Real-Time Strategy Games

The paper presents a constrained command‑conditioned Proximal Policy Optimization (PPO) executor for the MicroRTS real‑time strategy environment, enabling a single execution policy to follow diverse strategic commands. A Thompson‑sampling bandit strategist selects command tuples based on in‑game observations of the opponent’s strategy, rather than relying on opponent identity. In controlled experiments, the strategist‑executor system outperforms a flat PPO baseline against three of the four strongest opponents on a training map, including two held‑out opponents, while showing no significant difference against the remaining opponents.

By Nick Leenders, Roy Lindelauf, Joost van Oijen, Boris Cule
arXiv Machine Learning
Aug 28

Shared Actors Need Not Share Critics: Effects of Value Mismatch in Parallel Reinforcement Learning

The paper investigates the problem of sharing a single critic across multiple parallel environments in reinforcement learning. It shows that when environments assign different expected returns to the same state, a shared critic must reconcile conflicting value targets, which can distort advantage estimates and misguide policy updates. The authors propose a simple fix—providing the critic with the environment index—demonstrating through bandit models and experiments on CartPole, MuJoCo, BipedalWalker, and 16 Procgen games that this conditional critic stabilizes learning and boosts returns, achieving a 40.8% improvement in aggregate normalized return on unseen levels.

By Zhenya Liu, Yang Meng, Zhuokai Zhao, Xuefeng Liu, Yuxin Chen
arXiv AI
Sep 11

ROTATE: Regret-driven Open-ended Training for Ad Hoc Teamwork

The paper introduces ROTATE, a regret-driven open‑ended training framework that jointly improves an Ad Hoc Teamwork (AHT) agent and an adversarial teammate generator. Unlike traditional two‑stage pipelines, ROTATE alternates between enhancing the agent and generating teammates that specifically probe its collaboration weaknesses. Experiments on Overcooked and Level‑Based Foraging show that ROTATE outperforms existing baselines on unseen teammates, setting a new benchmark for robust, generalizable teamwork.

By Caroline Wang, Arrasy Rahman, Benjamin Nativi, Jiaxun Cui, Yoonchang Sung, Peter Stone
arXiv Machine Learning
Oct 7

Independent Multi-Agent Reinforcement Learning with Counterfactual Semantic-Social World Models

The paper introduces CASTLE, a framework for fully decentralized multi‑agent reinforcement learning that uses two offline‑trained world models to provide in‑context guidance to independent agents. A Local Dynamics World Model captures each agent’s trajectory dynamics, while a Semantic‑Social World Model predicts short‑horizon task and social outcomes for candidate actions based on counterfactual simulator rollouts. During online learning, these frozen models supply prediction logits to an independent PPO policy, enabling agents to compare potential actions prospectively rather than relying solely on scalar rewards. CASTLE outperforms existing baselines on several multi‑particle benchmark tasks, achieving the highest mean final scores across 30 seeds.

By Fernando Martinez, Tao Li, Yingdong Lu, Juntao Chen
arXiv Machine Learning
Sep 4

LLM-Guided Reinforcement Learning for Adaptive NPC Behavior in Multi-Agent Combat Games

The paper explores a runtime strategy-selection framework where a large language model (LLM) guides a pre‑trained reinforcement learning (RL) policy for non‑player characters (NPCs) in a Unity combat game without altering the underlying policy. Five NPC agents sharing a PPO policy were compared in a baseline setup and an LLM‑augmented setup, where a locally hosted Mistral 7B model assigns one of four tactical tags every five seconds based on live game state. Across 600 episodes against three scripted opponents, the LLM‑augmented agents more than doubled their win rate against a Balanced opponent, improved performance against an Evasive opponent, but struggled against an Aggressive opponent due to over‑reliance on encirclement; analysis of 2,430 strategy selections revealed limited zero‑shot differentiation with the model favoring Surround in 83.8% of cases.

By Hrithika Deepu Nair, Kayvan Karim
arXiv AI
Jun 9

Counterfactual Credit Policy Optimization for Multi-Agent Collaboration

arXiv:2603. 21563v4 Announce Type: replace Abstract: Collaborative multi-agent large language models (LLMs) can solve complex reasoning tasks by decomposing roles, but reinforcement learning for such systems is limited by credit assignment: shared terminal rewards obscure individual contributions and can encourage free-riding.

By Zhongyi Li, Wan Tian, Yikun Ban, Jinju Chen, Huiming Zhang, Yang Liu, Fuzhen Zhuang