Defender Strategies In Domains Involving Frequent Adversary Interaction

Recently, there has been an increase in interest in applying game theoretic approaches to domains involving frequent adversary interactions, such as wildlife and fishery protection. In these domains, the law enforcement agency faces adversaries who repeatedly and frequently carry out illegal activities, and thus, do not have time for extensive surveillance before taking actions. This makes them significantly different from counter-terrorism domains where game-theoretic approaches have been widely deployed. This paper presents a game-theoretic approach to be used by the defender in these Frequent Adversary Interaction (FAI) domains. We provide (i) a novel game model for FAI domains, describing the interaction between the defender and the attackers in a repeated game and (ii) algorithms that plan for the defender strategies to achieve high average expected utility over all rounds.

[1]  Michael H. Bowling,et al.  Regret Minimization in Games with Incomplete Information , 2007, NIPS.

[2]  Nicholas R. Jennings,et al.  Planning against fictitious players in repeated normal form games , 2010, AAMAS.

[3]  Yoav Shoham,et al.  Learning against opponents with bounded memory , 2005, IJCAI.

[4]  Sarit Kraus,et al.  Teaching and leading an ad hoc teammate: Collaboration without pre-coordination , 2013, Artif. Intell..

[5]  Milind Tambe,et al.  Online planning for optimal protector strategies in resource conservation games , 2014, AAMAS.

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

[7]  Nelson Cowan,et al.  Working Memory Capacity , 2005 .

[8]  H. Sabourian Repeated games with M-period bounded memory (pure strategies) , 1998 .

[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 2008.

[10]  Doran Chakraborty and Peter Stone,et al.  Targeted Opponent Modeling of Memory-Bounded Agents , 2013 .

[11]  Gerald Tesauro,et al.  Playing repeated Stackelberg games with unknown opponents , 2012, AAMAS.

[12]  Amos Azaria,et al.  Analyzing the Effectiveness of Adversary Modeling in Security Games , 2013, AAAI.

[13]  A. Rubinstein Modeling Bounded Rationality , 1998 .

[14]  Hamid Sabourian,et al.  Repeated games with one-memory , 2009, J. Econ. Theory.

[15]  Rong Yang,et al.  Adaptive resource allocation for wildlife protection against illegal poachers , 2014, AAMAS.

[16]  Ariel D. Procaccia,et al.  Learning Optimal Commitment to Overcome Insecurity , 2014, NIPS.

[17]  Tuomas Sandholm,et al.  A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation , 2006, AAMAS '06.