Optimal Deceptive Strategies in Security Games : A Preliminary Study

Attacker-defender Stackelberg games have been used in several deployed applications of game theory for infrastructure security. Security resources of the defender are game-theoretically allocated to prevent a strategic attacker from using surveillance to learn and exploit patterns in the allocation. Existing work on security games assumes that the defender honestly displays her real security resources. We introduce a new model in which the defender may use deceptive resources (e.g., a mock camera in the part for deterring potential adversaries, or a hidden camera on the road for detecting overspeed) to mislead the attacker. We provide algorithms for computing the defender’s optimal strategy in consideration of deceptions. We also present experimental results evaluating the effectiveness of using deceptive strategies.

[1]  H. Wimmer,et al.  Beliefs about beliefs: Representation and constraining function of wrong beliefs in young children's understanding of deception , 1983, Cognition.

[2]  E. Rasmussen Games and Information , 1989 .

[3]  Vincent Conitzer,et al.  Computing the optimal strategy to commit to , 2006, EC '06.

[4]  Sarit Kraus,et al.  Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games , 2008, AAMAS.

[5]  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.

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

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

[8]  Manish Jain,et al.  Software Assistants for Randomized Patrol Planning for the LAX Airport Police and the Federal Air Marshal Service , 2010, Interfaces.

[9]  V. Bier,et al.  Reasons for Secrecy and Deception in Homeland‐Security Resource Allocation , 2010, Risk analysis : an official publication of the Society for Risk Analysis.

[10]  Sarit Kraus,et al.  Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition , 2010, Artif. Intell..

[11]  Bo An,et al.  Refinement of Strong Stackelberg Equilibria in Security Games , 2011, AAAI.

[12]  Noa Agmon,et al.  Multiagent Patrol Generalized to Complex Environmental Conditions , 2011, AAAI.

[13]  Jun Zhuang,et al.  Balancing congestion and security in the presence of strategic applicants with private information , 2011, Eur. J. Oper. Res..

[14]  Bo An,et al.  Mixed-Initiative Optimization in Security Games: A Preliminary Report , 2011, AAAI Spring Symposium: Help Me Help You: Bridging the Gaps in Human-Agent Collaboration.

[15]  Milind Tambe,et al.  Security and Game Theory - Algorithms, Deployed Systems, Lessons Learned , 2011 .

[16]  Bo An,et al.  PROTECT: An Application of Computational Game Theory for the Security of the Ports of the United States , 2012, AAAI.

[17]  Bo An,et al.  Security Games with Limited Surveillance , 2012, AAAI.

[18]  Milind Tambe,et al.  A unified method for handling discrete and continuous uncertainty in Bayesian Stackelberg games , 2012, AAMAS.

[19]  Bo An,et al.  PROTECT: a deployed game theoretic system to protect the ports of the United States , 2012, AAMAS.

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

[21]  Sarit Kraus,et al.  Game-theoretic randomization for security patrolling with dynamic execution uncertainty , 2013, AAMAS.

[22]  Milind Tambe,et al.  Monotonic Maximin: A Robust Stackelberg Solution against Boundedly Rational Followers , 2013, GameSec.

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