# Vulnerability Analysis for Safe Multi-Agent Reinforcement Learning

Safe Multi-Agent Reinforcement Learning (SMARL) aims to learn cooperative control policies under prescribed safety constraints. Al- though existing SMARL methods focus on enforcing safety during policy optimization, their vulnerability remains largely unexplored. This paper investigates inference-time observation attacks against SMARL, where an adversary perturbs the observations of a subset of agents, thereby altering the actions produced by their policies. We propose MinMax Attack, an attack framework that jointly selects adversarial target actions for compromised agents while accounting for the Cooperative Resistance of benign agents. We further derive a bound on the induced safety cost and characterize its relation- ship with the Compromised-Agent Budget and the Perturbation Budget. Experiments across multiple safety-critical multi-agent benchmarks and representative state-of-the-art SMARL algorithms show that MinMax Attack induces substantially higher safety costs than existing attack baselines while preserving task reward, thereby reducing its detectability and achieving both attack effectiveness and stealthiness.

## Why It Matters

This work advances the encyclopedia's coverage of [Agents, Autonomy, and Tool Use](../agents-autonomy.md), [The AI Safety Debate](../ai-safety-debate.md), [AI Alignment](../alignment.md), [Emergent Abilities and Benchmark Evolution](../emergent-abilities.md), [Machine-Learning Algorithms](../ml-algorithms.md). The central idea—Safe Multi-Agent Reinforcement Learning (SMARL) aims to learn cooperative control policies under prescribed safety constraints. Al- though existing SMARL method—connects to the broader arc of recent AI research tracked in [Recent News](../../news.md).

## Sources

- rss: https://arxiv.org/abs/2610.27293

*Back to [Recent News](../../news.md) · [Sub-article index](../index.md).*