Stefan Rass, Sandra König,
"Synchronization in Security Games"
, in Fang, Feiand Xu, Haifengand Hayel, Yezekael: Decision and Game Theory for Security, Serie Lecture Notes of Computer Science 13727, Springer International Publishing, Cham, Seite(n) 129 - 148, 10-2023, ISBN: 978-3-031-26369-9
Synchronization in Security Games
Sprache des Titels:
Decision and Game Theory for Security
Security games often assume a fixed pattern in which players become active, like leader-follower alternation in Stackelberg games or simultaneous moves in Nash games. Stackelberg games are of particular popularity as models for security since they well describe adversaries that adapt to the defender's actions. Games in extensive or normal form herein induce a fixed sequence of when players become active. But why would a player in a security game wait for the opponent's move and not just take further actions to cause more damage or gain more? This work studies generalized interaction patterns motivated from the security context, in which each player can take actions as often as it likes, and receives a payoff from the game upon every activity. The practical scenario motivating this study is an adversary who does not wait for the defender to take action, but rather makes the most of the periods during which the defender is idle. This can mean to learn as possible about the victim system while the defender is not present, or to cause as much damage as possible before the defender can strike back.