Quasi-regular sequences and optimal schedules for security games

SODA '18: Symposium on Discrete Algorithms New Orleans Louisiana January, 2018, pp. 1625-1644, 2018.

Cited by: 12|Bibtex|Views19|Links
EI

Abstract:

We study security games in which a defender commits to a mixed strategy for protecting a finite set of targets of different values. An attacker, knowing the defender's strategy, chooses which target to attack and for how long. If the attacker spends time t at a target i of value αi, and if he leaves before the defender visits the target, ...More

Code:

Data:

Your rating :
0

 

Tags
Comments