Recent Progress on Computational Game Theory for Security
Bo An ( Nanyang Technological University, Singapore )
- 11:00 25th November 2016 ( week 7, Michaelmas Term 2016 )Lecture Theatre B
Security is a critical concern around the world, whether it’s the challenge of protecting ports, airports and other critical national infrastructure, or protecting wildlife and forests, or suppressing crime in urban areas. In many of these cases, limited security resources prevent full security coverage at all times; instead, these limited resources must be scheduled, avoiding schedule predictability, while simultaneously taking into account different target priorities, the responses of the adversaries to the security posture and potential uncertainty over adversary types. Computational game theory can help design such unpredictable security schedules and new algorithms are now deployed over multiple years in multiple applications for security scheduling. These applications are leading to real-world use-inspired research in computational game theory in scaling up to large-scale problems, handling significant adversarial uncertainty, dealing with bounded rationality of human adversaries, and other interdisciplinary challenges. This talk will discuss some recent research progress on computational game theory for security based on results published at recent AAMAS/AAAI/IJCAI conferences.