Solving Patrolling Problems in the Internet Environment

We propose an algorithm for constructing efficient patrolling strategies in the Internet environment, where the protected targets are nodes connected to the network and the patrollers are software agents capable of detecting/preventing undesirable activities on the nodes. The algorithm is based on a novel compositional principle designed for a special class of strategies, and it can quickly construct (sub)optimal solutions even if the number of targets reaches hundreds of millions.

[1]  Mariano Ceccato,et al.  CodeBender: Remote Software Protection Using Orthogonal Replacement , 2011, IEEE Software.

[2]  Antonín Kucera,et al.  Regular Strategies and Strategy Improvement: Efficient Tools for Solving Large Patrolling Problems , 2016, AAMAS.

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

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

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

[6]  Tomás Brázdil,et al.  Synthesizing Efficient Solutions for Patrolling Problems in the Internet Environment , 2018, ArXiv.

[7]  Sarit Kraus,et al.  Deployed ARMOR protection: the application of a game theoretic model for security at the Los Angeles International Airport , 2008, AAMAS 2008.

[8]  Nicola Basilico,et al.  Extending Algorithms for Mobile Robot Patrolling in the Presence of Adversaries to More Realistic Settings , 2009, 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology.

[9]  Yann Chevaleyre,et al.  Recent Advances on Multi-agent Patrolling , 2004, SBIA.

[10]  Nicola Basilico,et al.  Leader-follower strategies for robotic patrolling in environments with arbitrary topologies , 2009, AAMAS.

[11]  Ali Farhadi,et al.  You Only Look Once: Unified, Real-Time Object Detection , 2015, 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[12]  Nicola Basilico,et al.  Patrolling security games: Definition and algorithms for solving large instances with single patroller and single intruder , 2012, Artif. Intell..

[13]  Sarit Kraus,et al.  The impact of adversarial knowledge on adversarial planning in perimeter patrol , 2008, AAMAS.

[14]  Christian S. Collberg,et al.  Distributed application tamper detection via continuous software updates , 2012, ACSAC '12.

[15]  Branislav Bosanský,et al.  Computing time-dependent policies for patrolling games with mobile targets , 2011, AAMAS.

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

[17]  Nicholas R. Jennings,et al.  Introducing alarms in adversarial patrolling games: extended abstract , 2013, AAMAS.

[18]  Branislav Bosanský,et al.  Solving adversarial patrolling games with bounded error: (extended abstract) , 2014, AAMAS.

[19]  Nicola Basilico,et al.  A Security Game Model for Remote Software Protection , 2016, 2016 11th International Conference on Availability, Reliability and Security (ARES).

[20]  Milind Tambe,et al.  Optimal defender allocation for massive security games : A branch and price approach , 2010 .

[21]  Vincent Conitzer,et al.  Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness , 2010, AAMAS 2010.

[22]  Milind Tambe,et al.  Optimal patrol strategy for protecting moving targets with multiple mobile resources , 2013, AAMAS.

[23]  Leonard J. Schulman,et al.  Quasi-regular sequences and optimal schedules for security games , 2016, SODA.

[24]  Branislav Bosanský,et al.  Strategy Representation Analysis for Patrolling Games , 2012, AAAI Spring Symposium: Game Theory for Security, Sustainability, and Health.