Sequential Stackelberg equilibria in two-person games
Journal of Optimization Theory and Applications
Stackelberg Scheduling Strategies
SIAM Journal on Computing
Simulation and Gaming
Computing the optimal strategy to commit to
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track
Game Theoretical Insights in Strategic Patrolling: Model and Algorithm in Normal-Form
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
A polynomial-time algorithm for action-graph games
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Using game theory to analyze wireless ad hoc networks
IEEE Communications Surveys & Tutorials
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Computing optimal strategies to commit to in extensive-form games
Proceedings of the 11th ACM conference on Electronic commerce
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
How to protect a city: strategic security placement in graph-based domains
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Robust Bayesian methods for Stackelberg security games
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Methods and algorithms for infinite Bayesian Stackelberg security games
GameSec'10 Proceedings of the First international conference on Decision and game theory for security
GUARDS and PROTECT: next generation applications of security games
ACM SIGecom Exchanges
Security applications: lessons of real-world deployment
ACM SIGecom Exchanges
GUARDS: game theoretic security allocation on a national scale
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Computing time-dependent policies for patrolling games with mobile targets
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Improved computational models of human behavior in security games
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
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
Game theory and human behavior: challenges in security and sustainability
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Journal of Artificial Intelligence Research
Approximation algorithm for security games with costly resources
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Security games with multiple attacker resources
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Improving resource allocation strategy against human adversaries in security games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Randomized sensing in adversarial environments
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Security and network effects: centralized and decentralized perspectives
ACM SIGecom Exchanges
Multi-objective optimization for security games
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
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
Computing optimal security strategies in networked domains: a cost-benefit approach
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Security games with surveillance cost and optimal timing of attack execution
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Security games with interval uncertainty
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Computing Stackelberg strategies in stochastic games
ACM SIGecom Exchanges
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Game-theoretic question selection for tests
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Efficiently solving joint activity based security games
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Scaling-up security games with boundedly rational adversaries: a cutting-plane approach
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
An extended study on multi-objective security games
Autonomous Agents and Multi-Agent Systems
Protecting moving targets with multiple mobile resources
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theoretic methods to find optimal randomized security policies, including a fielded application at the Los Angeles International Airport (LAX). This approach has promising applications in many similar domains, including police patrolling for subway and bus systems, randomized baggage screening, and scheduling for the Federal Air Marshal Service (FAMS) on commercial flights. However, the existing methods scale poorly when the security policy requires coordination of many resources, which is central to many of these potential applications. We develop new models and algorithms that scale to much more complex instances of security games. The key idea is to use a compact model of security games, which allows exponential improvements in both memory and runtime relative to the best known algorithms for solving general Stackelberg games. We develop even faster algorithms for security games under payoff restrictions that are natural in many security domains. Finally, introduce additional realistic scheduling constraints while retaining comparable performance improvements. The empirical evaluation comprises both random data and realistic instances of the FAMS and LAX problems. Our new methods scale to problems several orders of magnitude larger than the fastest known algorithm.