Inducible equilibrium for security games

Guo, Qingyu, Gan, Jiarui, Fang, Fei, Tran-Thanh, Long, Tambe, Milind and An, Bo (2018) Inducible equilibrium for security games. In 17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018. vol. 3, International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). pp. 1947-1949 .

Abstract

Strong Stackelberg equilibrium (SSE) is the standard solution concept of Stackelberg security games. The SSE assumes that the follower breaks ties in favor of the leader and this is widely acknowledged and justified by the assertion that the defender can often induce the attacker to choose a preferred action by making an infinitesimal adjustment to her strategy. Unfortunately, in security games with resource assignment constraints, the assertion might not be valid. To overcome this issue, inspired by the notion of inducibility and the pessimistic Stackelberg equilibrium [20, 21], this paper presents the inducible Stackelberg equilibrium (ISE), which is guaranteed to exist and avoids overoptimism as the outcome can always be induced with infinitesimal strategy deviation. Experimental evaluation unveils the significant overoptimism and sub-optimality of SSE and thus, verifies the advantage of the ISE as an alternative solution concept.

This record has no associated files available for download.

Contributors

Author: Long Tran-Thanh

Download statistics