A branch and price algorithm for a Stackelberg Security Game. (September 2017)

• Record Type: Journal Article
• Authors: Lagos, Felipe; Ordóñez, Fernando; Labbé, Martine
• Is Part Of: Computers & industrial engineering. Volume 111(2017)
• Page Start: 216
• Page End: 227
• Publication Date: 2017-09
• Subjects: Column generation -- Stackelberg games -- Security; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2017.06.034
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: A column generation method for tight formulation of Stackelberg Security game model. Investigated speedups with use of greedy algorithm and dual variable smoothing. Evaluation of its use in a branch and price algorithm. 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.