Alarm systems represent a novel issue in Security Games, requiring new models that explicitly describe the dynamic interaction between the players. Recent works studied their employment, even considering various forms of uncertainty, and showed that disregarding them can lead to arbitrarily poor strategies. One of the key problems is computing the best strategy to respond to alarm signals for each mobile defensive resource. The current literature only solves the basic single-resource version of such problem. In this paper, we provide a solution for the multi-resource case addressing the challenge of designing algorithms to coordinate a scalingup number of resources. First, we focus on finding the minimum number of resources assuring non-null protection to every target. Then, we deal with the computation of multi-resource strategies with different degrees of coordination among resources resorting to adversarial team game models. For each considered problem, we provide algorithms and their theoretical and empirical analysis.

Coordinating multiple defensive resources in patrolling games with alarm systems / N. Basilico, G. De Nittis, A. Celli, N. Gatti (PROCEEDINGS OF THE INTERNATIONAL JOINT CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS). - In: AAMAS '17 : Proceedings[s.l] : ACM, 2017. - pp. 678-686 (( Intervento presentato al 16. convegno International Conference on Autonomous Agents and Multiagent Systems, AAMAS tenutosi a Sao Paulo nel 2017.

Coordinating multiple defensive resources in patrolling games with alarm systems

N. Basilico;
2017

Abstract

Alarm systems represent a novel issue in Security Games, requiring new models that explicitly describe the dynamic interaction between the players. Recent works studied their employment, even considering various forms of uncertainty, and showed that disregarding them can lead to arbitrarily poor strategies. One of the key problems is computing the best strategy to respond to alarm signals for each mobile defensive resource. The current literature only solves the basic single-resource version of such problem. In this paper, we provide a solution for the multi-resource case addressing the challenge of designing algorithms to coordinate a scalingup number of resources. First, we focus on finding the minimum number of resources assuring non-null protection to every target. Then, we deal with the computation of multi-resource strategies with different degrees of coordination among resources resorting to adversarial team game models. For each considered problem, we provide algorithms and their theoretical and empirical analysis.
Security Games; Alarm System; Multiple Defensive Resources
Settore INF/01 - Informatica
https://dl.acm.org/citation.cfm?id=3091222
Book Part (author)
File in questo prodotto:
File Dimensione Formato  
p678-basilico.pdf

accesso riservato

Tipologia: Publisher's version/PDF
Dimensione 248.05 kB
Formato Adobe PDF
248.05 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/2434/689502
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 17
  • ???jsp.display-item.citation.isi??? 10
social impact