Coordinating resources in Stackelberg Security Games

Víctor Bucarey (1, 2) , Carlos Casorrán (1, 2) , Martine Labbé (2, 1) , Fernando Ordoñez (3) , Oscar Figueroa (4)

1 ULB - Département d'Informatique [Bruxelles]
2 INOCS - Integrated Optimization with Complex Structure
3 DII - Departamento de Ingenieria Industrial [Santiago]
4 Carabineros de Chile

In this work we formulate a Stackelberg Security Game that coordinates resources in a border patrol problem. In this security domain, resources from different precincts have to be paired to conduct patrols in the border due to logistic constraints. Given this structure, models that enumerate the pure defender strategies scale poorly. We describe the set of mixed strategies using a polynomial number of variables but exponentially many constraints that come from the matching polytope. We then include this description in a mixed integer formulation to compute the Strong Stackelberg Equilibrium efficiently with a branch and cut scheme. Since the optimal patrol solution is a probability distribution over the set of exponential size, we also introduce an efficient sampling method that can be used to deploy the security resources every shift. Our computational results evaluate the efficiency of the branch and cut scheme developed and the accuracy of the sampling method.

Mots clés: OR in Defence; Bilevel Optimization; Stackelberg Games

Domaines: Recherche opérationnelle [math.OC]

Víctor Bucarey, Carlos Casorrán, Martine Labbé, Fernando Ordoñez, Oscar Figueroa. Coordinating resources in Stackelberg Security Games. European Journal of Operational Research, 2021, ⟨10.1016/j.ejor.2019.11.002⟩. ⟨hal-02999966⟩