Randomized Pursuit-Evasion in Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Leader-follower strategies for robotic patrolling in environments with arbitrary topologies
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Multi-step multi-sensor hider-seeker games
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A graph-theoretic approach to protect static and moving targets from adversaries
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
GUARDS and PROTECT: next generation applications of security games
ACM SIGecom Exchanges
Securing networks using game theory: algorithms and applications
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Security games with mobile patrollers
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Bribery in path-disruption games
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Game theory and human behavior: challenges in security and sustainability
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Solving non-zero sum multiagent network flow security games with attack costs
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Game-theoretic resource allocation for malicious packet detection in computer networks
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Game theory for security: an important challenge for multiagent systems
EUMAS'11 Proceedings of the 9th European conference on Multi-Agent Systems
Security scheduling for real-world networks
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Security games with contagion: handling asymmetric information
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Using double-oracle method and serialized alpha-beta search for pruning in simultaneous move games
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Sharing rewards in cooperative connectivity games
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
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.