@conference {1503005,
	title = {Solving Zero-Sum Security Games in Discretized Spatio-Temporal Domains },
	booktitle = {28th Conference on Artificial Intelligence (AAAI 2014)},
	year = {2014},
	address = {Qu{\'e}bec, Canada},
	abstract = {Among the many deployment areas of Stackelberg Security games, a major area involves games played out in
space and time, which includes applications in multiple
mobile defender resources protecting multiple mobile
targets. Previous algorithms for such spatio-temporal
security games fail to scale-up and little is known of
the computational complexity properties of these problems. This paper provides a novel oracle-based algorithmic framework for a systematic study of different problem variants of computing optimal (minimax) strategies
in spatio-temporal security games. Our framework enables efficient computation of a minimax strategy when
the problem admits a polynomial-time oracle. Furthermore, for the cases in which efficient oracles are difficult to find, we propose approximations or prove hardness results.},
	author = {Haifeng Xu and Fang, Fei and Xin Jiang, Albert and Vincent Conitzer and Dughmi, Shaddin and Tambe, Milind}
}
