Coordinating Multiple Defensive Resources in Patrolling Games with Alarm Systems

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 scaling-up 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.

[1]  Yuval Filmus,et al.  The Power of Local Search: Maximum Coverage over a Matroid , 2012, STACS.

[2]  Manish Jain,et al.  Computing optimal randomized resource allocations for massive security games , 2009, AAMAS 2009.

[3]  Vangelis Th. Paschos,et al.  Completeness in approximation classes beyond APX , 2006, Theor. Comput. Sci..

[4]  Bo An,et al.  Security games with surveillance cost and optimal timing of attack execution , 2013, AAMAS.

[5]  The myth of the Folk Theorem , 2010 .

[6]  B. Stengel,et al.  Team-Maxmin Equilibria☆ , 1997 .

[7]  Nicola Basilico,et al.  A Security Game Model for Environment Protection in the Presence of an Alarm System , 2015, GameSec.

[8]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[9]  B. Stengel,et al.  Leadership with commitment to mixed strategies , 2004 .

[10]  Nicola Basilico,et al.  Capturing augmented sensing capabilities and intrusion delay in patrolling-intrusion games , 2009, 2009 IEEE Symposium on Computational Intelligence and Games.

[11]  Nysret Musliu,et al.  Local Search Algorithm for Unicost Set Covering Problem , 2006, IEA/AIE.

[12]  Ariel D. Procaccia,et al.  Lazy Defenders Are Almost Optimal against Diligent Attackers , 2014, AAAI.

[13]  Nicola Basilico,et al.  Asynchronous Multi-Robot Patrolling against Intrusions in Arbitrary Topologies , 2010, AAAI.

[14]  Sarit Kraus,et al.  Multi-robot perimeter patrol in adversarial settings , 2008, 2008 IEEE International Conference on Robotics and Automation.

[15]  Nicola Basilico,et al.  A Security Game Combining Patrolling and Alarm-Triggered Responses Under Spatial and Detection Uncertainties , 2016, AAAI.

[16]  Rong Yang,et al.  Improving Resource Allocation Strategy against Human Adversaries in Security Games , 2011, IJCAI.

[17]  Nicola Basilico,et al.  Adversarial patrolling with spatially uncertain alarm signals , 2015, Artif. Intell..

[18]  L. S. Shapley,et al.  3. BASIC SOLUTIONS OF DISCRETE GAMES , 1951 .

[19]  Kristoffer Arnsfelt Hansen,et al.  Approximability and Parameterized Complexity of Minmax Values , 2008, WINE.

[20]  Bo An,et al.  An Overview of Recent Application Trends at the AAMAS Conference: Security, Sustainability and Safety , 2012, AI Mag..