Minimizing Expected Intrusion Detection Time in Adversarial Patrolling

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F22%3A00126563" target="_blank" >RIV/00216224:14330/22:00126563 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.ifaamas.org/Proceedings/aamas2022/pdfs/p1660.pdf" target="_blank" >https://www.ifaamas.org/Proceedings/aamas2022/pdfs/p1660.pdf</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.5555/3535850.3536068" target="_blank" >10.5555/3535850.3536068</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Minimizing Expected Intrusion Detection Time in Adversarial Patrolling

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Minimizing Expected Intrusion Detection Time in Adversarial Patrolling

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/EF18_053%2F0016952" target="_blank" >EF18_053/0016952: Postdoc2MUNI</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022.

ISBN

9781450392136

ISSN

1548-8403

e-ISSN

—

Počet stran výsledku

3

Strana od-do

1660-1662

Název nakladatele

International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)

Místo vydání

Neuveden

Místo konání akce

Auckland, New Zealand

Datum konání akce

9. 5. 2022

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—