The Power of Modeling Human Adversary Behaviors in Security Games

Recent deployments of Stackelberg security games (SSG) have led to two competing approaches to handle boundedly rational human adversaries: (1) integrating models of human (adversary) decision-making into the gametheoretic algorithms, and (2) applying robust optimization techniques that avoid adversary modeling. A recent algorithm (MATCH) based on the second approach was shown to outperform the leading modeling-based algorithm even in the presence of significant amount of data. Is there then any value in using human behavior models in solving SSGs? Through extensive experiments with 547 human subjects playing 11102 games in total, we emphatically answer the question in the affirmative, while providing the following key contributions: (i) we show that our algorithm, SU-BRQR, based on a novel integration of human behavior model with the subjective utility function, significantly outperforms both MATCH and its improvements; (ii) we are the first to present experimental results with security intelligence experts, and find that even though the experts are more rational than the Amazon Turk workers, SU-BRQR still outperforms an approach assuming perfect rationality (and to a more limited extent MATCH); (iii) we show the advantage of SU-BRQR in a new, large game setting and demonstrate that sufficient data enables it to improve its performance over MATCH.

[1]  ปิยดา สมบัติวัฒนา Behavioral Game Theory: Experiments in Strategic Interaction , 2013 .

[2]  Milind Tambe,et al.  Patrol Strategies to Maximize Pristine Forest Area , 2012, AAAI.

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

[4]  Rong Yang,et al.  A robust approach to addressing human adversaries in security games , 2012, AAMAS.

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

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

[7]  Yevgeniy Vorobeychik,et al.  Computing Randomized Security Strategies in Networked Domains , 2011, Applied Adversarial Reasoning and Risk Modeling.

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

[9]  Vincent Conitzer,et al.  Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games , 2010, AAAI.

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

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

[12]  Syngjoo Choi,et al.  Social learning in networks: a Quantal Response Equilibrium analysis of experimental data , 2012 .

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

[14]  Yoav Shoham,et al.  Run the GAMUT: a comprehensive approach to evaluating game-theoretic algorithms , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[15]  R. Wilcox Applying Contemporary Statistical Techniques , 2003 .

[16]  Trevor Hastie,et al.  The Elements of Statistical Learning , 2001 .

[17]  P. Greenwood,et al.  A Guide to Chi-Squared Testing , 1996 .

[18]  J. Conlisk Why Bounded Rationality , 1996 .

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

[20]  Philip A. Haile,et al.  On the Empirical Content of Quantal Response Equilibrium , 2003 .

[21]  J. March Bounded rationality, ambiguity, and the engineering of choice , 1978 .