Minimizing Expected Intrusion Detection Time in Adversarial Patrolling

Investor logo

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

KLAŠKA David KUČERA Antonín MUSIL Vít ŘEHÁK Vojtěch

Year of publication 2022
Type Article in Proceedings
Conference 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022.
MU Faculty or unit

Faculty of Informatics

Citation
Web Paper URL
Doi http://dx.doi.org/10.5555/3535850.3536068
Keywords Security Games; Adversarial Patrolling
Description In adversarial patrolling games, a mobile Defender strives to discover intrusions at vulnerable targets initiated by an Attacker. The Attacker’s utility is traditionally defined as the probability of completing an attack, possibly weighted by target costs. However, in many real-world scenarios, the actual damage caused by the Attacker depends on the time elapsed since the attack’s initiation to its detection. We introduce a formal model for such scenarios, and we show that the Defender always has an optimal strategy achieving maximal protection. We also prove that finite-memory Defender’s strategies are sufficient for achieving protection arbitrarily close to the optimum. Then, we design an efficient strategy synthesis algorithm based on differentiable programming and gradient descent.We evaluate the efficiency of our method experimentally.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info