Skip to content

HySTAR: Anchored Hypergraphs for Stable Credit Assignment in Cooperative Multi-Agent Reinforcement Learning

Sep 2026 · 0 citations · 38 references
Computer Science

TL;DR

This work introduces HySTAR, a MAPPO-based framework that separates adaptive representation learning from a temporally consistent high-order value-decomposition basis, and demonstrates consistent improvements over MAPPO-style, value-factorization, and dynamic-grouping baselines.

Abstract

Cooperative multi-agent reinforcement learning under partial observability and shared rewards requires assigning team outcomes to individual agents and high-order coalitions. A MAPPO-style critic compresses joint behavior into one global value, while critics that dynamically reconstruct the grouping topology change the mapping from agents and coalitions to value components as interactions or active agents evolve. We refer to this inconsistency as structural target drift. We introduce HySTAR, a MAPPO-based framework that separates adaptive representation learning from a temporally consistent high-order value-decomposition basis. HySTAR anchors an overlapping sparse hypergraph as a uniformly covered decomposition scaffold, uses a spatiotemporal encoder to represent physical and task-dependent interactions, and combines temporal and structural relevance to construct agent-specific advantages. Experiments on SMAC, GRF, Traffic Junction, and MPE demonstrate consistent improvements over MAPPO-style, value-factorization, and dynamic-grouping baselines. On the hardest SMAC settings, HySTAR achieves relative gains of 16.7\% over MAPPO and 15.6\% over HYGMA, ranks first on all six GRF scenarios, reduces Traffic Junction convergence epochs by up to 40.2\% relative to MAGIC, and obtains the highest MPE episode rewards. Controlled topology, agent-death, neighborhood, and parameter analyses support the benefit of anchoring the decomposition scaffold while adapting the propagated representations.

View source

Similar papers

#edge computing Sep 2026

MAB-PGC: Multiagent Mutual Awareness Belief via Progressive Graph Construction.

This work proposes a multiagent belief state computation method termed mutual awareness belief (MAB), which extends belief modeling to decentralized partially observable settings by incorporating agents' behavioral intentions and collaborative relationships and proves effective in the nonmonotonic Pursuit environment.

Si-Han Zhou, Tian-Tian He, Yi-Nan Guo et al. · 0 citations
#machine learning Preprint Oct 2026

Continual Graph Multi-Agent Reinforcement Learning

In Continual Multi-Agent Reinforcement Learning (CMARL), agents learn cooperative policies across sequences of tasks, aiming to adapt effectively to new tasks while preserving the ability to solve previously encountered ones. In many applications, tasks differ in their underlying structure, which can represent, for exa...

Tommaso Marzi, Ahmed Hendawy, Jan Peters et al. · 0 citations
#artificial intelligence Preprint Sep 2026

CoRe-MARL: Cooperative Redistribution Under Unknown Dynamics Using Recurrent Multi-Agent Reinforcement Learning

This study develops CoRe-MARL, a cooperative multi-agent reinforcement learning (MARL) framework, by formulating a decentralized partially observable Markov decision process (Dec-POMDP), and finds that MAPPO reduces the service gap across local centers and enhances service for the worst-served center while maintaining...

Naimur Rahman Chowdhury, Shatabdi Sen Prapti, Md. Salehin Seyam et al. · 0 citations
Open access Sep 2026

Exploration by Multi-Agent Relationship Graph Reconstruction

Efficient exploration remains a key challenge in cooperative multi-agent reinforcement learning (MARL), where the novelty of a joint situation may arise not only from unfamiliar individual observations but also from previously underrepresented interaction patterns among agents. Existing intrinsic-reward approaches comm...

Ya-Xin Xu, Yin-Xiang He, Tian-Yi Liu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

SHARPO: Segment-Level Credit Assignment for Agentic Reinforcement Learning

Agentic reinforcement learning (RL) trains a large language model (LLM) to act over long, multi-step interactions. However, a single localized error can cause task failure, while trajectory-level rewards provide limited guidance for assigning credit to individual decisions. To address this limitation, we introduce Segm...

Xin-Chen Du, Zheng-Ze Zhou, Wen-Hui Zhu et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

MIT News · Artificial Intelligence Oct 23, 2026

Q&A: How AI came to model the “messy” human mind

Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.