A branch and price algorithm for a Stackelberg Security Game

Felipe Lagos 1 Fernando Ordóñez 2 Martine Labbé 3, 4, 5
4 INOCS - Integrated Optimization with Complex Structure
ULB - Université Libre de Bruxelles [Bruxelles], Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : Mixed integer optimization formulations are an attractive alternative to solve Stackelberg Game problems thanks to the efficiency of state of the art mixed integer algorithms. In particular, decomposition algorithms, such as branch and price methods, make it possible to tackle instances large enough to represent games inspired in real world domians. In this work we focus on Stackelberg Games that arise from a security application and investigate the use of a new branch and price method to solve its mixed integer optimization formulation. We prove that the algorithm provides upper and lower bounds on the optimal solution at every iteration and investigate the use of stabilization heuristics. Our preliminary computational results compare this solution approach with previous decomposition methods obtained from alternative integer programming formulations of Stackelberg games.
Document type :
Journal articles
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

Contributor : Bernard Fortz <>
Submitted on : Thursday, December 21, 2017 - 2:27:33 PM
Last modification on : Friday, March 22, 2019 - 1:34:18 AM


Files produced by the author(s)




Felipe Lagos, Fernando Ordóñez, Martine Labbé. A branch and price algorithm for a Stackelberg Security Game. Computers and Industrial Engineering, Elsevier, 2017, 111, pp.216 - 227. ⟨10.1016/j.cie.2017.06.034⟩. ⟨hal-01666454⟩



Record views


Files downloads