Computational Game Theory for Security

This chapter surveys computational game-theoretic models and solution methods for security applications, with an emphasis on Stackelberg games. Security interactions are modeled as sequential games in which a defender commits to a strategy first and then the attacker best responds.The chapter introduces Stackelberg and Bayesian Stackelberg games, develops Stackelberg security games with scalable solution techniques, and presents applications to network interdiction and dynamic security settings. Particular attention is given to stochastic Stackelberg games and adversarial patrolling, highlighting both zero-sum and general-sum formulations. The chapter concludes by discussing computational challenges and open research directions in security game modeling.