---
title: "Scaling-up Security Games with Boundedly Rational Adversaries: A Cutting-plane Approach"
authors:
  - "Rong Yang"
  - "Albert Xin Jiang"
  - "Milind Tambe"
  - "Fernando Ordóñez"
doi: ""
url: "https://ijcai.org/proceedings/2013/67"
pdf: "https://ijcai.org/proceedings/2013/0067.pdf"
venue: "Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence"
year: 2013
pages: "404-409"
track: ""
keywords:
---

# Scaling-up Security Games with Boundedly Rational Adversaries: A Cutting-plane Approach

Rong Yang, Albert Xin Jiang, Milind Tambe, Fernando Ordóñez

*Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence*, pages 404-409.

## Abstract

To improve the current real-world deployments of Stackelberg security games (SSGs), it is critical now to efficiently incorporate models of adversary bounded rationality in large-scale SSGs. Unfortunately, previously proposed branch-and-price approaches fail to scale-up given the non-convexity of such models, as we show with a realization called COCOMO. Therefore, we next present a novel cutting-plane algorithm called BLADE to scale-up SSGs with complex adversary models, with three key novelties: (i) an efficient scalable separation oracle to generate deep cuts; (ii) a heuristic that uses gradient to further improve the cuts; (iii) techniques for quality-efficiency tradeoff.