Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

Novel formulations for general and security Stackelberg games

Carlos Casorrán 1, 2 Bernard Fortz 1, 2 Martine Labbé 1, 2 Fernando Ordóñez 3 
1 INOCS - Integrated Optimization with Complex Structure
Inria Lille - Nord Europe, ULB - Université libre de Bruxelles, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : In this paper we analyze general Stackelberg games (SGs) and Stackelberg security games (SSGs). SGs are hierarchical adversarial games where players select actions or strategies to optimize their payoffs in a sequential manner. SSGs are a type of SGs that arise in security applications, where the strategies of the player that acts first consist in protecting subsets of targets and the strategies of the followers consist in attacking one of the targets. We review existing mixed integer optimization formulations in both the general and the security setting and present new formulations for both settings. We compare the SG formulations and the SSG formulations both from a theoretical and a computational point of view. Our theoretical results show that the new formulations provide tighter linear relaxations. Our computational experiments show that the new formulations give better solution times.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Bernard Fortz Connect in order to contact the contributor
Submitted on : Saturday, January 7, 2017 - 3:16:26 PM
Last modification on : Tuesday, November 22, 2022 - 2:26:16 PM
Long-term archiving on: : Saturday, April 8, 2017 - 12:13:12 PM


Files produced by the author(s)


  • HAL Id : hal-01429265, version 1



Carlos Casorrán, Bernard Fortz, Martine Labbé, Fernando Ordóñez. Novel formulations for general and security Stackelberg games. 2016. ⟨hal-01429265⟩



Record views


Files downloads