Pith. sign in

REVIEW 44 cited by

Is Independent Learning All You Need in the StarCraft Multi-Agent Challenge?

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 2011.09533 v1 pith:P7TTZ2I5 submitted 2020-11-18 cs.AI

Is Independent Learning All You Need in the StarCraft Multi-Agent Challenge?

classification cs.AI
keywords learningindependentippomulti-agentapproachescentralizedfunctionjoint
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Most recently developed approaches to cooperative multi-agent reinforcement learning in the \emph{centralized training with decentralized execution} setting involve estimating a centralized, joint value function. In this paper, we demonstrate that, despite its various theoretical shortcomings, Independent PPO (IPPO), a form of independent learning in which each agent simply estimates its local value function, can perform just as well as or better than state-of-the-art joint learning approaches on popular multi-agent benchmark suite SMAC with little hyperparameter tuning. We also compare IPPO to several variants; the results suggest that IPPO's strong performance may be due to its robustness to some forms of environment non-stationarity.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 44 Pith papers

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

  1. Structural Equivalence and Learning Dynamics in Delayed MARL

    cs.LG 2026-05 accept novelty 8.0

    Observation and action delays are formally equivalent in cooperative Dec-POMDPs, yielding identical optimal solutions and enabling zero-shot transfer, though learning dynamics differ due to credit assignment and opera...

  2. Aggregate in the Advantage, Not the Ratio: A Canonical-Form Analysis of Cooperative Multi-Agent Policy Optimization

    cs.MA 2026-07 conditional novelty 7.0

    For cooperative PPO, the expected gradient at the on-policy point depends on advantage and ratio aggregation supports only through their matrix product, and the variance-optimal design keeps the ratio per-agent and ag...

  3. HiComm: Hierarchical Communication for Multi-agent Reinforcement Learning

    cs.AI 2026-06 unverdicted novelty 7.0

    HiComm proposes a plug-in hierarchical communication protocol for cooperative MARL that performs structured information retrieval over observation hierarchies using receiver queries and three-stage decoding, matching ...

  4. Benchmarking Open-Ended Multi-Agent Coordination in Language Agents

    cs.AI 2026-06 unverdicted novelty 7.0

    ALEM benchmark reveals LLM agents achieve only ~6% normalized return in open-ended multi-agent settings, with communication as the main driver of coordination and individual task competence not implying coordination c...

  5. ARMS: Automatic Reward Shaping for Sparse-Reward Multi-Agent Reinforcement Learning

    cs.MA 2026-05 unverdicted novelty 7.0

    ARMS is an automatic reward-shaping framework for sparse-reward MARL that uses trajectory ranking and conditional best-response reasoning to preserve Nash equilibria while improving sampling efficiency in pathfinding tasks.

  6. Randomness is sometimes necessary for coordination

    cs.AI 2026-05 conditional novelty 7.0

    Structured per-agent randomness via ranked masking in attention allows symmetric agents to break ties and coordinate, achieving perfect success on symmetric tasks where deterministic policies fail and enabling zero-sh...

  7. Quality-Aware Exploration Budget Allocation for Cooperative Multi-Agent Reinforcement Learning

    cs.MA 2026-05 unverdicted novelty 7.0

    A quality-aware exploration method using return-conditioned sigmoid scheduling and per-agent RSQ metrics achieves top-tier returns on seven cooperative MARL benchmarks.

  8. One Step is Enough: Multi-Agent Reinforcement Learning based on One-Step Policy Optimization for Order Dispatch on Ride-Sharing Platforms

    cs.AI 2025-07 conditional novelty 7.0

    OSPO trains optimal order dispatch policies for homogeneous AV fleets using only one-step group rewards, outperforming GRPO on a real ride-hailing dataset.

  9. Dreamer-CPC: Message Learning with World Models for Decentralized Multi-agent Reinforcement Learning

    cs.MA 2026-07 conditional novelty 6.0

    Dreamer-CPC has each decentralized agent send messages drawn from its learned world-model memory, outperforming current-observation messaging baselines, especially when key observations are temporarily missing.

  10. Memory as a Controlled Process: Learned Adaptive Memory Management for LLM Agents

    cs.CL 2026-07 conditional novelty 6.0

    A tabular UCB controller trained on task success improves LLM-agent memory use over fixed heuristics, without extra LLM calls.

  11. Action-Factored Multi-Agent Reinforcement Learning for Scalable Quantum Device Tuning

    cs.LG 2026-07 conditional novelty 6.0

    Online action-space factorization via Kalman-refined cross-capacitance lets shared multi-agent policies zero-shot tune larger quantum-dot arrays with near-constant steps.

  12. Queue-Aware Graph Reinforcement Learning for UAV-ISAC-Assisted Maritime Data Collection

    eess.SY 2026-07 unverdicted novelty 6.0

    A queue-weighted graph-MARL framework with masked sequential b-matching for UAV-buoy associations improves cumulative collection utility by 106% over rate-driven baselines in maritime ISAC simulations.

  13. HiComm: Hierarchical Communication for Multi-agent Reinforcement Learning

    cs.AI 2026-06 unverdicted novelty 6.0

    HiComm converts MARL communication into structured three-stage hierarchical retrieval over sender observations, matching or exceeding baselines with up to 23x lower communication volume per receiver per episode.

  14. Contract-Based Compositional Shielding for Safe Multi-Agent Reinforcement Learning

    cs.LG 2026-06 conditional novelty 6.0

    Certified local LTL_safe contracts, jointly fixed-point checked and selected by a bandit, recover coordinated safe team policies under decentralised multi-agent RL execution.

  15. Uncertainty-Aware Motion Planning for Autonomous Driving in Mixed Traffic Environment

    cs.RO 2026-06 unverdicted novelty 6.0

    UAMP adds a proximity-aware uncertainty estimator and Uncertainty-Calibrated Value Learning to reinforcement learning motion planning so autonomous vehicles can handle uncertain human intents in mixed traffic.

  16. One Policy, Infinite NPCs: Persona-Traceable Shared RL Policies for Scalable Game Agents

    cs.AI 2026-05 unverdicted novelty 6.0

    pcsp is a shared RL policy using LLM persona embeddings, low-rank projection, and PPO+InfoNCE+KL training that delivers 17x above-chance zero-shot persona identification and 22x faster inference on a 300-persona benchmark.

  17. GAE Falls Short in Imperfect-Information Self-Play Reinforcement Learning

    cs.LG 2026-05 unverdicted novelty 6.0

    GAE suffers from amplified variance in imperfect-info self-play RL; VRPO with Q-boosting and multi-step Expected SARSA(λ) reduces it and improves performance on mid-to-large games.

  18. Robust Instruction Compliance in Cooperative Multi-Agent Reinforcement Learning

    cs.AI 2026-05 unverdicted novelty 6.0

    MAVIC corrects Bellman backups at instruction boundaries by adjusting the incoming objective and restoring continuation value, enabling consistent estimation under stochastic instruction switching in a unified policy.

  19. Robust Instruction Compliance in Cooperative Multi-Agent Reinforcement Learning

    cs.AI 2026-05 unverdicted novelty 6.0

    MAVIC corrects Bellman backups at instruction boundaries by adjusting the incoming objective and restoring continuation value, enabling consistent estimation under stochastic instruction switching in cooperative MARL.

  20. Shaping Zero-Shot Coordination via State Blocking

    cs.LG 2026-05 unverdicted novelty 6.0

    SBC generates virtual environments via state blocking to expose agents to diverse suboptimal partner policies, yielding superior zero-shot coordination performance including with humans.

  21. Priority-Driven Control and Communication in Decentralized Multi-Agent Systems via Reinforcement Learning

    eess.SY 2026-05 unverdicted novelty 6.0

    A model-free priority-driven RL method learns joint control and communication in decentralized multi-agent systems and outperforms baselines on benchmarks.

  22. Rethinking Ratio-Based Trust Regions for Policy Optimization in Multi-Agent Reinforcement Learning

    cs.LG 2026-05 unverdicted novelty 6.0

    MARS replaces additive clipping and soft penalties in multi-agent trust-region methods with a symmetric geometric barrier, matching or exceeding MAPPO and MASPO performance across 47 tasks in eight environments.

  23. SACHI: Structured Agent Coordination via Holistic Information Integration in Multi-Agent Reinforcement Learning

    cs.LG 2026-05 conditional novelty 6.0

    SACHI enriches agent representations via graph transformer convolutions over inter-agent graphs to enable holistic information integration, outperforming baselines across five cooperative tasks with statistical significance.

  24. SACHI: Structured Agent Coordination via Holistic Information Integration in Multi-Agent Reinforcement Learning

    cs.LG 2026-05 unverdicted novelty 6.0

    SACHI uses graph transformer convolutions on inter-agent coordination graphs to enrich partial-observation agents with content-dependent teammate information, yielding statistically significant gains over baselines in...

  25. Hierarchical Multiagent Reinforcement Learning for Multi-Group Tax Game

    cs.MA 2026-05 unverdicted novelty 6.0

    A bi-level MARL framework with curriculum learning and closed-loop sequential updates learns stable tax policies in multi-group hierarchical games, extending effective game duration by 60.92% and cutting GDP dispariti...

  26. Hierarchical Multiagent Reinforcement Learning for Multi-Group Tax Game

    cs.MA 2026-05 unverdicted novelty 6.0

    A bilevel MARL framework with curriculum learning and closed-loop sequential updates learns stable tax policies in multi-group taxation simulations, extending effective game duration by 60.92% and reducing GDP dispari...

  27. Dynamics of Cognitive Heterogeneity: Investigating Behavioral Biases in Multi-Stage Supply Chains with LLM-Based Simulation

    cs.MA 2026-04 unverdicted novelty 6.0

    Heterogeneous LLM agents in supply chain simulations exhibit myopic self-interested behaviors that worsen inefficiencies, but information sharing mitigates these effects.

  28. TABX: A High-Throughput Sandbox Battle Simulator for Multi-Agent Reinforcement Learning

    cs.MA 2026-02 unverdicted novelty 6.0

    Presents TABX, a modular JAX-accelerated sandbox simulator enabling customizable multi-agent tasks and high-throughput evaluation for cooperative MARL.

  29. TABX: A High-Throughput Sandbox Battle Simulator for Multi-Agent Reinforcement Learning

    cs.MA 2026-02 conditional novelty 6.0

    TABX is a JAX-based, GPU-accelerated, configurable multi-agent battle simulator that lets researchers vary units, terrain, and physics to benchmark cooperative MARL algorithms.

  30. Learning Decentralized LLM Collaboration with Multi-Agent Actor Critic

    cs.AI 2026-01 unverdicted novelty 6.0

    Multi-agent actor-critic methods with a centralized critic improve decentralized LLM collaboration over Monte Carlo baselines in long-horizon and sparse-reward settings.

  31. Automata-Conditioned Cooperative Multi-Agent Reinforcement Learning

    cs.MA 2025-11 conditional novelty 6.0

    ACC-MARL trains decentralized multi-agent policies that solve many automaton-specified cooperative tasks at once, with a proof of optimality for the Markovian reformulation and value-based task assignment.

  32. Multi-Agent Reinforcement Learning for Safe Autonomous Driving Under Pedestrian Behavioral Uncertainty

    cs.LG 2026-05 unverdicted novelty 5.0

    Co-training an SDC and 12 pedestrians with MAPPO in a MARL setup yields 78% goal success and 14% collisions versus 35% goals and 33% for the best rule-based baseline, with jaywalking linked to 62% of collisions despit...

  33. Priority-Driven Control and Communication in Decentralized Multi-Agent Systems via Reinforcement Learning

    eess.SY 2026-05 unverdicted novelty 5.0

    A priority-driven RL algorithm learns joint communication priorities and control policies for decentralized multi-agent systems in a model-free way and outperforms baselines on benchmark tasks.

  34. A Survey of Multi-Agent Deep Reinforcement Learning with Graph Neural Network-Based Communication

    cs.LG 2026-04 unverdicted novelty 5.0

    A survey of MARL with GNN-based communication that proposes a generalized process to organize and clarify existing methods.

  35. Diffusing to Coordinate: Efficient Online Multi-Agent Diffusion Policies

    cs.AI 2026-02 conditional novelty 5.0

    A diffusion-policy multi-agent RL framework substitutes an ELBO for intractable joint entropy and reports 2.5–5× sample-efficiency gains on 10 MPE/MAMuJoCo tasks.

  36. Learning Decentralized LLM Collaboration with Multi-Agent Actor Critic

    cs.AI 2026-01 conditional novelty 5.0

    Centralized-critic actor-critic training (CoLLM-CC) improves sample efficiency and stability over Monte-Carlo multi-agent RL for training decentralized LLM collaboration.

  37. CoRL-MPPI: Enhancing MPPI With Learnable Behaviours For Efficient And Provably-Safe Multi-Robot Collision Avoidance

    cs.RO 2025-11 conditional novelty 5.0

    CoRL-MPPI injects a learned cooperative policy into MPPI's sampling distribution to speed up and make safer multi-robot navigation in dense simulations.

  38. Centralized Adaptive Sampling for Reliable Co-Training of Independent Multi-Agent Policies

    cs.LG 2025-08 unverdicted novelty 5.0

    CoSER adaptively samples joint actions in CTDE MARL to reduce sampling error relative to the joint on-policy distribution, empirically improving reliability of independent policy gradient convergence.

  39. Low Variance Trust Region Optimization with Independent Actors and Sequential Updates in Cooperative Multi-agent Reinforcement Learning

    cs.LG 2026-06 unverdicted novelty 4.0

    Proposes a clipping objective for sequential trust-region updates in independent-actor cooperative MARL that yields a monotonic improvement bound and sub-linear convergence to epsilon-Nash equilibria while reducing ad...

  40. $\alpha$-fair heterogeneous agent reinforcement learning

    cs.MA 2026-06 unverdicted novelty 4.0

    Introduces α-fair HATRPO and HAPPO algorithms that integrate α-fairness into HATRL via a weighted advantage function while claiming to preserve convergence to Nash equilibria.

  41. Multi-Agent Reinforcement Learning for Safe Autonomous Driving Under Pedestrian Behavioral Uncertainty

    cs.LG 2026-05 unverdicted novelty 4.0

    Co-training an SDC and pedestrians with MAPPO yields 78% goal success and 14% collisions versus 35%/33% for rule-based baselines, with jaywalking causing 62% of collisions and evidence of poor anticipation via speed d...

  42. Reinforcement Learning for LLM-based Multi-Agent Systems through Orchestration Traces

    cs.CL 2026-05 unverdicted novelty 4.0

    This survey organizes RL for LLM multi-agent systems into reward families, credit units, and five orchestration sub-decisions, notes the absence of explicit stopping-decision training in its paper pool, and releases a...

  43. Dynamics of Cognitive Heterogeneity: Investigating Behavioral Biases in Multi-Stage Supply Chains with LLM-Based Simulation

    cs.MA 2026-04 unverdicted novelty 4.0

    LLM-based agents simulating supply chain tiers exhibit known behavioral biases, and information sharing mitigates resulting inefficiencies.

  44. GLo-MAPPO: Multi-Agent Deep Reinforcement Learning for Energy-Efficient UAV-Assisted LoRa Networks

    cs.NI 2025-09 unverdicted novelty 4.0

    GLo-MAPPO applies centralized-training decentralized-execution MAPPO with a gain-based association scheme to jointly optimize LoRa parameters and UAV paths, yielding higher weighted energy efficiency than prior MARL b...