Sciweavers

5 search results - page 1 / 1
» Computing optimal randomized resource allocations for massiv...
Sort
View
ATAL
2009
Springer
13 years 11 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
AAAI
2010
13 years 6 months ago
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
AAAI
2010
13 years 6 months ago
Security Games with Arbitrary Schedules: A Branch and Price Approach
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
Manish Jain, Erim Kardes, Christopher Kiekintveld,...
ATAL
2010
Springer
13 years 5 months ago
A graph-theoretic approach to protect static and moving targets from adversaries
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
John P. Dickerson, Gerardo I. Simari, V. S. Subrah...
ATAL
2011
Springer
12 years 4 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe