Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees

TL;DR

This paper introduces an algorithm for optimally scheduling agents in attack-defence trees to minimize attack time and agent count, enhancing the analysis of multi-agent security scenarios.

Contribution

It proposes a novel algorithm for synthesizing agent assignments that minimize attack time and agent number in attack-defence trees.

Findings

Algorithm effectively reduces attack time in simulations.

Minimizes the number of agents needed for attack strategies.

Provides insights into agent task allocation impacts.

Abstract

Expressing attack-defence trees in a multi-agent setting allows for studying a new aspect of security scenarios, namely how the number of agents and their task assignment impact the performance, e.g. attack time, of strategies executed by opposing coalitions. Optimal scheduling of agents' actions, a non-trivial problem, is thus vital. We discuss associated caveats and propose an algorithm that synthesises such an assignment, targeting minimal attack time and using minimal number of agents for a given attack-defence tree.