Event
Advanced Networks Colloquia Series: Milind Tambe, "Security and Game Theory"
Friday, November 30, 2012
11:00 a.m.
1146 A.V. Williams Building
Kimberly Edwards
301 405 6579
kedwards@umd.edu
http://www.isr.umd.edu/events/ancs.htm
The Advanced Networks Colloquium
Security and Game Theory: Key Algorithmic Principles, Deployed Applications, Lessons Learned
Milind Tambe
Helen N. and Emmett H. Jones Professor in Engineering
Professor, Computer Science and Industrial Systems Engineering
University of Southern California
Host
John Baras
Lecture at 11:00 a.m.
Roundtable discussion at 2:00 p.m. (also in 1146 AVW)
Abstract
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. 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: for the US coast guard in Boston and New York (and potentially other ports), for the Federal Air Marshals(FAMS), for the Los Angeles Airport Police, with the Los Angeles Sheriff's Department for patrolling metro trains, with further applications under evaluation for the TSA and other agencies. These applications are leading to real-world use-inspired research in the emerging research area of "security games"; specifically, the research challenges posed by these applications include scaling up security games to large-scale problems, handling significant adversarial uncertainty, dealing with bounded rationality of human adversaries, and other interdisciplinary challenges. This lecture will provide an overview of my research's group's work in this area, outlining key algorithmic principles, research results, as well as a discussion of our deployed systems and lessons learned.
Biography
Milind Tambe is Helen N. and Emmett H. Jones Professor in Engineering, and Professor of Computer Science and Industrial and Systems Engineering at the University of Southern California(USC). He leads the TEAMCORE Research Group at USC, with research focused on agent-based and multi-agent systems. He is a fellow of AAAI, recipient of the ACM/SIGART Autonomous Agents Research Award, as well as recipient of the Christopher Columbus Fellowship Foundation Homeland security award. In addition, he is also the receipient of the "influential paper award" from the International Foundation for Agents and Multiagent Systems, the Rist Prize of the Military Operations Research Society, US Coast Guard First District's Operational Excellence Award, Certificate of Appreciation from the US Federal Air Marshals Service, special commendation given by the Los Angeles World Airports police from the city of Los Angeles, IBM Faculty Award, Okawa foundation faculty research award, the RoboCup scientific challenge award, USC Viterbi School of Engineering use-inspired research award, USC Steven B. Sample Teaching and Mentoring award and the ACM recognition of service award.
Prof. Tambe and his research group's papers have been selected as best papers at a number of premier Artificial Intelligence Conferences and workshops; these have included best paper awards at the International Conference on Autonomous Agents and Multiagent Systems and International Conference on Intelligent Virtual Agents. Additionally, algorithms developed by his Teamcore research group have been deployed for real-world use by several agencies including the US Coast Guard, the US Federal Air Marshals service, LAX Police and the LA Sheriff's Department. He received his Ph.D. from the School of Computer Science at Carnegie Mellon University.
