Planning and Learning in Security Games


Francesco Maria Delle Fave, Yundi Qian, Albert Xin Jiang, Matthew Brown, and Milind Tambe. 2013. “Planning and Learning in Security Games .” In ACM SigEcom Exchanges, 3rd ed. Vol. 11.


We present two new critical domains where security games are applied to generate randomized patrol schedules. For each setting, we present the current research that we have produced. We then propose two new challenges to build accurate schedules that can be deployed effectively in the real world. The first is a planning challenge. Current schedules cannot handle interruptions. Thus, more expressive models, that allow for reasoning over stochastic actions, are needed. The second is a learning challenge. In several security domains, data can be used to extract information about both the environment and the attacker. This information can then be used to improve the defender’s strategies.
See also: 2013