Building real stackelberg security games for border patrols
Author
dc.contributor.author
Bucarey, Víctor
Author
dc.contributor.author
Casorrán, Carlos
Author
dc.contributor.author
Figueroa, Óscar
Author
dc.contributor.author
Rosas, Karla
Author
dc.contributor.author
Navarrete, Hugo
Author
dc.contributor.author
Ordóñez Pizarro, Fernando
Admission date
dc.date.accessioned
2019-05-29T14:00:15Z
Available date
dc.date.available
2019-05-29T14:00:15Z
Publication date
dc.date.issued
2017
Cita de ítem
dc.identifier.citation
Lecture Notes in Computer Science , LNCS, Volumen 10575, 2017
Identifier
dc.identifier.issn
16113349
Identifier
dc.identifier.issn
03029743
Identifier
dc.identifier.other
10.1007/978-3-319-68711-7_11
Identifier
dc.identifier.uri
https://repositorio.uchile.cl/handle/2250/169196
Abstract
dc.description.abstract
We present a decision support system to help plan preventive border patrols. The system represents the interaction between defenders and intruders as a Stackelberg security game (SSG) where the defender pools local resources to conduct joint preventive border patrols. We introduce a new SSG that constructs defender strategies that pair adjacent precincts to pool resources that are used to patrol a location within one of the two precincts. We introduce an efficient formulation of this problem and an efficient sampling method to construct an implementable defender strategy.
The system automatically constructs the Stackelberg game from geographically located past crime data, topology and cross border information. We use clustering of past crime data and logit probability distribution to assign risk to patrol areas. Our results on a simplified real-world inspired border patrol instance show the computational efficiency of the model proposed, its robustness with respect to parameters used in automatically constructing the instance, and the quality of the sampled solution obtained.