KLAŠKA, David, Antonín KUČERA, Vít MUSIL and Vojtěch ŘEHÁK. Minimizing Expected Intrusion Detection Time in Adversarial Patrolling. Online. In Piotr Faliszewski, Viviana Mascardi, Catherine Pelachaud, Matthew E. Taylor. 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022. Neuveden: International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2022, p. 1660-1662. ISBN 978-1-4503-9213-6. Available from: https://dx.doi.org/10.5555/3535850.3536068.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Minimizing Expected Intrusion Detection Time in Adversarial Patrolling
Authors KLAŠKA, David (203 Czech Republic, belonging to the institution), Antonín KUČERA (203 Czech Republic, guarantor, belonging to the institution), Vít MUSIL (203 Czech Republic, belonging to the institution) and Vojtěch ŘEHÁK (203 Czech Republic, belonging to the institution).
Edition Neuveden, 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022. p. 1660-1662, 3 pp. 2022.
Publisher International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
Publication form electronic version available online
WWW Paper URL
RIV identification code RIV/00216224:14330/22:00126563
Organization unit Faculty of Informatics
ISBN 978-1-4503-9213-6
ISSN 1548-8403
Doi http://dx.doi.org/10.5555/3535850.3536068
Keywords in English Security Games; Adversarial Patrolling
Tags formela-conference
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 28/3/2023 11:53.
Abstract
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.
Links
CZ.02.2.69/0.0/0.0/18_053/0016952, interní kód MU
(CEP code: EF18_053/0016952)
Name: Postdoc2MUNI
Investor: Ministry of Education, Youth and Sports of the CR, Priority axis 2: Development of universities and human resources for research and development
EF18_053/0016952, research and development projectName: Postdoc2MUNI
MUNI/A/1145/2021, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace XI. (Acronym: SV-FI MAV XI.)
Investor: Masaryk University
0011629866, interní kód MUName: Models, Algorithms, and Tools for Solving Adversarial Security Problems
Investor: Ostatní - foreign
PrintDisplayed: 3/6/2024 11:07