Coordinated defender strategies for border patrols - Archive ouverte HAL Access content directly
Journal Articles European Journal of Operational Research Year : 2021

Coordinated defender strategies for border patrols

(1) , (2) , (2) , (1) , (3)
1
2
3

Abstract

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.
Fichier principal
Vignette du fichier
combined_defender.pdf (1.35 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01917782 , version 1 (09-11-2018)

Identifiers

  • HAL Id : hal-01917782 , version 1

Cite

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⟩
206 View
223 Download

Share

Gmail Facebook Twitter LinkedIn More