Game theory for security: Key algorithmic principles, deployed systems, lessons learned

摘要: Security is a critical concern around the world. In many security domains, limited resources prevent full coverage at all times; instead, these must be scheduled, avoiding schedule predictability, while simultaneously taking into account different target priorities, responses of adversaries to posture and potential uncertainty over adversary types. Computational game theory can help design such unpredictable schedules. Indeed, casting problem as Bayesian Stackelberg game, we have developed new algorithms that are now deployed multiple years in applications for scheduling. These leading real-world use-inspired research emerging area “security games” specifically, challenges posed by include scaling up games large-scale problems, handling significant adversarial uncertainty, dealing with bounded rationality human adversaries, other interdisciplinary challenges.