Security is a critical concern around the world and 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. Indeed, casting the problem as a Bayesian Stackelberg game, we have developed new algorithms that are now deployed over multiple years in multiple applications for security scheduling including at the Los Angeles International Airport (LAX), for the Federal Air Marshals (FAMS), and for the US coast guard. 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 recent progress in solving complex security games and improving solution robustness.
Prof. An will also introduce potential PhD opportunities in Singapore.
Bo An is a Nanyang Assistant Professor with the School of Computer Engineering, Nanyang Technological University, Singapore. His current research interests include artificial intelligence, multiagent systems, game theory, and optimization. He has published over 40 referred papers at top conferences, including AAMAS, IJCAI, and AAAI and journals such as IEEE Transactions. Dr. An was the recipient of the 2010 IFAAMAS Victor Lesser Distinguished Dissertation Award, an Operational Excellence Award from the Commander, First Coast Guard District of the United States, and the Best Innovative Application Paper Award at AAMAS’12 and the 2012 INFORMS Daniel H. Wagner Prize for Excellence in Operations Research Practice. He is a member of the Board of Directors of IFAAMAS.