A Fast Algorithm for Robust Action Selection in Multi-Agent Systems

TL;DR

This paper introduces a fast, tunable algorithm for robust action selection in multi-agent systems that guarantees performance under worst-case attacks, significantly improving efficiency and effectiveness.

Contribution

A novel fast algorithm with tunable parameters for robust multi-agent action selection under adversarial attacks, outperforming existing methods in speed and robustness.

Findings

Algorithm achieves lower computational complexity.

Enhanced robustness against worst-case attacks.

Simulation results confirm improved performance.

Abstract

In this paper, we consider a robust action selection problem in multi-agent systems where performance must be guaranteed when the system suffers a worst-case attack on its agents. Specifically, agents are tasked with selecting actions from a common ground set according to individualized objective functions, and we aim to protect the system against attacks. In our problem formulation, attackers attempt to disrupt the system by removing an agent's contribution after knowing the system solution and thus can attack perfectly. To protect the multi-agent system against such attacks, we aim to maximize the minimum performance of all agents' individual objective functions under attacks. Thus, we propose a fast algorithm with tunable parameters for balancing complexity and performance, yielding substantially improved time complexity and performance compared to recent methods. Finally, we provide Monte Carlo simulations to demonstrate the performance of the proposed algorithm.