Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
P. Paruchuri,J. Pearce,3 Autori,Sarit Kraus
2008 · DOI: 10.1145/1402298.1402348
Adaptive Agents and Multi-Agent Systems · 510 citazioni
TLDR
This paper considers Bayesian Stackelberg games, in which the leader is uncertain about the types of adversary it may face, and presents an efficient exact algorithm for finding the optimal strategy for the leader to commit to in these games.