Coordinated defender strategies for border patrols

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

1 DII - Departamento de Ingenieria Industrial [Santiago]
2 INOCS - Integrated Optimization with Complex Structure
3 Instituto de Estudios Urbanos y Territoriales

An effective patrol of a large area can require the coordinated action of diverse security resources. In this work we formulate a Stackelberg Security game that coordinates such 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 the set of pure defender strategies is of exponential size. 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. We show the applicability of the methodology by solving a real world border patrol problem.

Mots clés: Stackelberg games; Matching polyhedra; Security application

Domaines: Recherche opérationnelle [math.OC]

Víctor Bucarey, Carlos Casorrán, Martine Labbé, Fernando Ordóñez, Oscar Figueroa. Coordinated defender strategies for border patrols. European Journal of Operational Research, 2021. ⟨hal-01917782⟩