Modeling Human Bounded Rationality to Improve Defender Strategies in Network Security Games

In a Network Security Game (NSG), security agencies must allocate limited resources to protect targets embedded in a network, such as important buildings in a city road network. A recent line of work relaxed the perfectrationality assumption of human adversary and showed significant advantages of incorporating the bounded rationality adversary models in non-networked security domains. Given that real-world NSG are often extremely complex and hence very difficult for humans to solve, it is critical that we address human bounded rationality when designing defender strategies. To that end, the key contributions of this paper include: (i) comprehensive experiments with human subjects using a web-based game that we designed to simulate NSGs; (ii) new behavioral models of human adversary in NSGs, which we train with the data collected from human experiments; (iii) new algorithms for computing the defender optimal strategy against the new models.

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

[2]  Milind Tambe,et al.  Urban security: game-theoretic resource allocation in networked physical domains , 2010, AAAI 2010.

[3]  Alan Washburn,et al.  Two-Person Zero-Sum Games for Network Interdiction , 1995, Oper. Res..

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

[5]  Rene G. Burgess,et al.  Realistic Human Path Planning using Fluid Simulation , 2004 .

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

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

[8]  D. Stahl,et al.  Experimental evidence on players' models of other players , 1994 .

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

[10]  P. Todd,et al.  Simple Heuristics That Make Us Smart , 1999 .

[11]  Colin Camerer,et al.  A Cognitive Hierarchy Model of Games , 2004 .

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

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

[14]  Seth Bullock,et al.  Simple Heuristics That Make Us Smart , 1999 .