Reward Poisoning Attacks On Offline Multi-agent Reinforcement Learning

Abstract

In offline multi-agent reinforcement learning (MARL), agents estimate policies from a given dataset. We study reward-poisoning attacks in this setting where an exogenous attacker modifies the rewards in the dataset before the agents see the dataset. The attacker wants to guide each agent into a nefarious target policy while minimizing the \(L^p\) norm of the reward modification. Unlike attacks on single-agent RL, we show that the attacker can install the target policy as a Markov Perfect Dominant Strategy Equilibrium (MPDSE), which rational agents are guaranteed to follow. This attack can be significantly cheaper than separate single-agent attacks. We show that the attack works on various MARL agents including uncertainty-aware learners, and we exhibit linear programs to efficiently solve the attack problem. We also study the relationship between the structure of the datasets and the minimal attack cost. Our work paves the way for studying defense in offline MARL.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keywu2022reward

Related papers

• Efficient Adversarial Attacks On Online Multi-agent Reinforcement Learning (2023)0.00
• Efficient Reward Poisoning Attacks On Online Deep Reinforcement Learning (2022)0.00
• Universal Black-box Reward Poisoning Attack Against Offline Reinforcement Learning (2024)0.00
• Policy Teaching In Reinforcement Learning Via Environment Poisoning Attacks (2020)0.00
• Reward Poisoning In Reinforcement Learning: Attacks Against Unknown Learners In Unknown Environments (2021)0.00
• Online Poisoning Attack Against Reinforcement Learning Under Black-box Environments (2024)0.00
• Black-box Targeted Reward Poisoning Attack Against Online Deep Reinforcement Learning (2023)0.00
• Vulnerability-aware Poisoning Mechanism For Online RL With Unknown Dynamics (2020)0.00