Security Games Applied to Real-World: Research Contributions and Challenges

The goal of this chapter is to introduce a challenging real-world problem for researchers in multiagent systems and beyond, where our collective efforts may have a significant impact on activities in the real-world. The challenge is in applying game theory for security: our goal is not only to introduce the problem, but also to provide exemplars of initial successes of deployed systems in this problem arena. Furthermore, we present key ideas and algorithms for solving and understanding the characteristics large-scale real-world security games, and then present some key open research challenges in this area.

[1]  A. Tversky,et al.  Prospect theory: an analysis of decision under risk — Source link , 2007 .

[2]  Gerald G. Brown,et al.  Defending Critical Infrastructure , 2006, Interfaces.

[3]  Rudolf Avenhaus,et al.  Inspection Games , 2009, Encyclopedia of Complexity and Systems Science.

[4]  Milind Tambe,et al.  The Deployment-to-Saturation Ratio in Security Games , 2012, AAAI.

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

[6]  Milind Tambe,et al.  TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems , 2012, IAAI.

[7]  R. McKelvey,et al.  Quantal Response Equilibria for Normal Form Games , 1995 .

[8]  Vincent Conitzer,et al.  A double oracle algorithm for zero-sum security games on graphs , 2011, AAMAS.

[9]  Manish Jain,et al.  Security Games with Arbitrary Schedules: A Branch and Price Approach , 2010, AAAI.

[10]  Branislav Bosanský,et al.  Game-theoretic resource allocation for malicious packet detection in computer networks , 2012, AAMAS.

[11]  Bo An,et al.  Multi-objective optimization for security games , 2012, AAMAS.

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

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

[14]  Milind Tambe,et al.  Deployed Security Games for Patrol Planning , 2013 .

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

[16]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

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

[18]  Rong Yang,et al.  Challenges in Patrolling to Maximize Pristine Forest Area (Position Paper) , 2012, AAAI Spring Symposium: Game Theory for Security, Sustainability, and Health.

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

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

[21]  S. Hart,et al.  HANDBOOK OF GAME THEORY , 2011 .

[22]  Milind Tambe,et al.  GUARDS: game theoretic security allocation on a national scale , 2011, AAMAS.

[23]  Nicola Gatti,et al.  Game Theoretical Insights in Strategic Patrolling: Model and Algorithm in Normal-Form , 2008, ECAI.

[24]  Milind Tambe,et al.  A Framework for Evaluating Deployed Security Systems: Is There a Chink in your ARMOR? , 2010, Informatica.

[25]  A. Tversky,et al.  Prospect theory: analysis of decision under risk , 1979 .

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

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

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

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

[30]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[31]  Tansu Alpcan,et al.  Network Security , 2010 .

[32]  Gerald G. Brown,et al.  A Two-Sided Optimization for Theater Ballistic Missile Defense , 2005, Oper. Res..

[33]  Milind Tambe,et al.  Towards Optimal Patrol Strategies for Urban Security in Transit Systems , 2011 .

[34]  A. Haurie,et al.  Sequential Stackelberg equilibria in two-person games , 1985 .

[35]  K. Pauwels,et al.  Effects of Word-of-Mouth versus Traditional Marketing: Findings from an Internet Social Networking Site , 2009 .

[36]  Milind Tambe,et al.  Security and Game Theory: IRIS – A Tool for Strategic Security Allocation in Transportation Networks , 2011, AAMAS 2011.

[37]  G. Leitmann On generalized Stackelberg strategies , 1978 .

[38]  Jeannette M. Wing,et al.  Game strategies in network security , 2005, International Journal of Information Security.

[39]  Bernhard von Stengel,et al.  Chapter 51 Inspection games , 2002 .

[40]  Nicholas J. Howard,et al.  Finding optimal strategies for influencing social networks in two player games , 2010 .

[41]  T. Sandler,et al.  Terrorism & Game Theory , 2003 .

[42]  Milind Tambe,et al.  Approximation methods for infinite Bayesian Stackelberg games: modeling distributional payoff uncertainty , 2011, AAMAS.

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

[44]  Vincent Conitzer,et al.  Learning and Approximating the Optimal Strategy to Commit To , 2009, SAGT.

[45]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[46]  Manish Jain,et al.  Risk-Averse Strategies for Security Games with Execution and Observational Uncertainty , 2011, AAAI.

[47]  H. Stackelberg,et al.  Marktform und Gleichgewicht , 1935 .

[48]  Bo An,et al.  GUARDS and PROTECT: next generation applications of security games , 2011, SECO.

[49]  Manish Jain,et al.  Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up , 2011, AAMAS.

[50]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.