Security games with mobile patrollers

To optimally secure large and complex infrastructures against crime activities, a scalable model for optimal defender allocation is needed. Game theory is successfully used to formalize the problem as a two-player game between an attacker and a defender. We consider both player to be mobile and we focus on proper path intersection modeling and we observe the trade-off between fidelity and computational complexity. We search for the a Nash Equlibirium of the game using oracle based algorithms and we evaluate the robustness of the solution in a multi-agent simulation where some assumptions made do not strictly hold.