@conference {1506497,
	title = {Randomizing Security Activities with Attacker Circumvention Strategies },
	booktitle = {AAMAS 2010 Workshop on Optimisation in Multi-Agent Systems (OptMas)},
	year = {2010},
	abstract = {Game theoretic methods for making resource allocation decision
in security domains have attracted growing attention from both researchers and security practitioners, including deployed applications at both the LAX airport and the Federal Air Marshals Service. We develop a new class of security games designed to model
decisions faced by the Transportation Security Administration and
other agencies in protecting airports, ports, and other critical infrastructure. Our model allows for a more diverse set of security
activities for the defensive resources than previous work, which
has generally focused on interchangeable resources that can only
defend against possible attacks in one way. Here, we are concerned
in particular with the possibility that adversaries can circumvent
specific security activities if they are aware of common security
measures. The model we propose takes this capability into account and generates more unpredictable, diverse security policies
as a result{\textemdash}without resorting to an external value for entropy or
randomness.
Solving these games is a significant computational challenge, and
existing algorithms are not capable of solving realistic games. We
introduce a new method that exploits common structure in these
problems to reduce the size of the game representation and enable
faster solution algorithm. These algorithms are able to scale to
make larger games than existing solvers, as we show in our experimental results.},
	author = {Pita, James and Kiekintveld, Christopher and Michael Scott and Tambe, Milind}
}
