Extending Security Games to Defenders with Constrained Mobility

A number of real-world security scenarios can be cast as a problem of transiting an area guarded by a mobile patroller, where the transiting agent aims to choose its route so as to minimize the probability of encountering the patrolling agent, and vice versa. We model this problem as a two-player zero-sum game on a graph, termed the transit game. In contrast to the existing models of area transit, where one of the players is stationary, we assume both players are mobile. We also explicitly model the limited endurance of the patroller and the notion of a base to which the patroller has to repeatedly return. Noting the prohibitive size of the strategy spaces of both players, we develop single- and double-oracle based algorithms including a novel acceleration scheme, to obtain optimum route selection strategies for both players. We evaluate the developed approach on a range of transit game instances inspired by real-world security problems in the urban and naval security domains.

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

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

[3]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[4]  Avrim Blum,et al.  Planning in the Presence of Cost Functions Controlled by an Adversary , 2003, ICML.

[5]  P. Hudson Search Games , 1982 .

[6]  S. Alpern Infiltration games on arbitrary graphs , 1992 .

[7]  Michal Pechoucek,et al.  Using Multi-agent Simulation to Improve the Security of Maritime Transit , 2011, MABS.

[8]  Branislav Bosanský,et al.  Transiting areas patrolled by a mobile adversary , 2010, Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games.

[9]  M. Rehm,et al.  Proceedings of AAMAS , 2005 .

[10]  M. M. Flood THE HIDE AND SEEK GAME OF VON NEUMANN , 1972 .

[11]  Jason M. Schwier,et al.  Markovian Search Games in Heterogeneous Spaces , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[12]  Michal Pechoucek,et al.  Using Agents to Improve International Maritime Transport Security , 2011, IEEE Intelligent Systems.

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

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

[15]  William H. Ruckle,et al.  Ambushing Random Walks I: Finite Models , 1976, Oper. Res..

[16]  Vincent Conitzer,et al.  Multi-Step Multi-Sensor Hider-Seeker Games , 2009, IJCAI.

[17]  Sarit Kraus,et al.  A graph-theoretic approach to protect static and moving targets from adversaries , 2010, AAMAS.