| Security is one of the biggest concerns all around the world. There are only a limited number of resources that can be allocated in security coverage. Terrorists can exploit any pattern of monitoring deployed by the security personnel. It becomes important to make the security pattern unpredictable and randomized. In such a scenario, the security forces can be randomized using algorithms based on Stackelberg games.;Stackelberg games have recently gained significant importance in deployment for real world security. Game-theoretic techniques make a standard assumption that adversaries' actions are perfectly rational. It is a challenging task to account for human behavior in such circumstances.;What becomes more challenging in applying game-theoretic techniques to real-world security problems is the standard assumption that the adversary is perfectly rational in responding to security forces' strategy, which can be unrealistic for human adversaries. Different models in the form of PT, PT-Attract, COBRA, DOBSS and QRE have already been proposed to address the scenario in settings with fixed number of targets. My work focuses on the evaluation of these models when the number of targets is varied, giving rise to an entirely new problem set. |
