Game theory for Security: Key Algorithmic Principles, Deployed Systems, Lessons Learned

Add to your list(s) Download to your calendar using vCal

• Milind Tambe, University of Southern California
• Friday 29 June 2012, 10:00-11:00
• Large lecture theatre, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge.

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

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 allocate limited security resources, while avoiding schedule predictability. 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: at the Los Angeles International Airport (LAX), for the Federal Air Marshals (FAMS), for the US coast guard in Boston, New York and Los Angeles (and potentially other ports); and applications are under evaluation for the TSA and for the Los Angeles Sheriff’s department. 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 outline key principles of our algorithms, major research results and open problems.

• This is joint work with a large number of collaborators, including former and current students, postdocs, and several other colleagues, listed at: http://teamcore.usc.edu/security

This talk is part of the Microsoft Research Cambridge, public talks series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Guy Emerson's list
• Interested Talks
• Large lecture theatre, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge
• Microsoft Research Cambridge, public talks
• Optics for the Cloud
• PMRFPS's
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• personal list
• rp587

Note that ex-directory lists are not shown.