A double oracle algorithm for zero-sum security games on graphs

Published

Journal Article

In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithms for similar security-related scheduling problems have been proposed in recent literature, but security scheduling in networked domains when targets have varying importance remains an open problem at large. In this paper, we cast the network security problem as an attacker- defender zero-sum game. The strategy spaces for both players are exponentially large, so this requires the development of novel, scalable techniques. We first show that existing algorithms for approximate solutions can be arbitrarily bad in general settings. We present Rugged (Randomization in Urban Graphs by Generating strategies for Enemy and Defender), the first scalable optimal solution technique for such network security games. Our technique is based on a double oracle approach and thus does not require the enumeration of the entire strategy space for either of the players. It scales up to realistic problem sizes, as is shown by our evaluation of maps of southern Mumbai obtained from GIS data. Categories and Subject Descriptors 1.2.11 [Artificial Intelligence]: Distributed Artificial Intelligence General Terms Algorithms, Security, Performance. Copyright © 2011, International Foundation for Autonomous Agents and Multiagent Systems.

Duke Authors

Cited Authors

  • Jain, M; Korzhyk, D; Vaněk, O; Conitzer, V; Pěchouček, M; Tambe, M

Published Date

  • January 1, 2011

Published In

  • 10th International Conference on Autonomous Agents and Multiagent Systems 2011, Aamas 2011

Volume / Issue

  • 1 /

Start / End Page

  • 305 - 312

Citation Source

  • Scopus