Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-4hhp2 Total loading time: 0 Render date: 2024-06-05T07:38:41.148Z Has data issue: false hasContentIssue false

4 - Deployed ARMOR Protection: The Application of a Game-Theoretic Model for Security at the Los Angeles International Airport

from PART II - DEPLOYED APPLICATIONS

Published online by Cambridge University Press:  05 January 2012

Get access

Summary

Introduction

Protecting the national infrastructure, such as airports, historical landmarks, or locations of political or economic importance, is a challenging task for police and security agencies around the world, one that is exacerbated by the threat of terrorism. The protection of important locations includes such tasks as monitoring all entrances or inbound roads and checking inbound traffic. However, limited resources mean that it is typically impossible to provide full security coverage at all times. Furthermore, adversaries can observe security arrangements over time and exploit any predictable patterns to their advantage. Randomizing schedules for patrolling, checking, or monitoring is thus an important tool in the police arsenal to avoid the vulnerability that comes with predictability. Even beyond protecting infrastructure, randomized patrolling is important in tasks varying from security on university campuses to normal police beats to border or maritime security (Billante 2003; Paruchuri et al. 2007; Ruan et al. 2005).

This paper focuses on a deployed software-assistant agent that can aid police or other security agencies in randomizing their security schedules. We face at least three key challenges in building such a software assistant. First, the assistant must provide quality guarantees in randomization by appropriately weighing the costs and benefits of the different options available. For example, if an attack on one part of an infrastructure would cause economic damage while an attack on another could potentially cost human lives, we must weigh the two options differently – giving higher weight (probability) to guarding the latter.

Type
Chapter
Information
Security and Game Theory
Algorithms, Deployed Systems, Lessons Learned
, pp. 67 - 87
Publisher: Cambridge University Press
Print publication year: 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

,General Description: Just the Facts. http://www.lawa.org/lax/justTheFact.cfm, 2007.
N., Billante. The Beat Goes On: Policing for Crime Prevention. http://www.cis.org.au/IssueAnalysis/ia38/ia38.htm, 2003.
G., Brown, M., Carlyle, J., Salmeron, and K., Wood. Defending Critical Infrastructure. Interfaces, 36(6):530–544, 2006.Google Scholar
V., Conitzer and T., Sandholm. Computing the Optimal Strategy to Commit to. In International Conference on Electronic Commerce (EC), 2006.Google Scholar
D., Fudenberg and J., Tirole. Game Theory. MIT Press, 1991.Google Scholar
J. C., Harsanyi and R., Selten. A Generalized Nash Solution for Two-person Bargaining Games With Incomplete Information. Management Science, 18(5):80–106, 1972.Google Scholar
R. C., Larson. A Hypercube Queuing Model for Facility Location and Redistricting in Urban Emergency Services. Computer and OR, 1(1):67–95, 1974.Google Scholar
A., Murr. The Element of Surprise. Newsweek National News, http://www.msnbc.msn.com/id/21035785/site/newsweek/page/0/, September 28, 2007.
P., Paruchuri, J. P., Pearce, J., Marecki, M., Tambe, F., Ordóñez, and S., Kraus. Playing games for security: An efficient exact algorithm for solving bayesian stackelberg games. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2008.Google Scholar
P., Paruchuri, J. P., Pearce, M., Tambe, F., Ordóñez, and S., Kraus. An Efficient Heuristic Approach for Security Against Multiple Adversaries. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2007.Google Scholar
P., Paruchuri, M., Tambe, F., Ordóñez, and S., Kraus. Security in Multiagent Systems by Policy Randomization. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2006.Google Scholar
P., Paruchuri, M., Tabme, F., Ordóñez, and S., Kraus. Safety in Multiagent Systems by Policy Randomization. In International Workshop on Safety and Security in Multiagent Systems (SASEMAS), 2005.Google Scholar
S., Ruan, C., Meirina, F., Yu, K. R., Pattipati, and R. L., Popp. Patrolling in a Stochastic Environment. In 10th Intl. Command and Control Research and Tech. Symp., 2005.Google Scholar
D., Stevens and et al. Implementing Security Improvement Options at Los Angeles International Airport. http://www.rand.org/pubs/documented_briefings/2006/RAND_DB499-1.pdf, 2006.
W. A., Wagenaar. Generation of Random Sequences by Human Subjects: A Critical Survey of Literature. 1972.

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×