Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-02T23:36:22.097Z Has data issue: false hasContentIssue false

6 - GUARDS: Game-Theoretic Security Allocation on a National Scale

from PART II - DEPLOYED APPLICATIONS

Published online by Cambridge University Press:  05 January 2012

Get access

Summary

Introduction

The United States Transportation Security Administration (TSA) is tasked with protecting the nation's transportation systems. These systems are often large in scale and protecting them requires many personnel and security activities. One set of systems in particular is the over 400 airports. These airports serve approximately 28,000 commercial flights per day and up to approximately 87,000 total flights [Air Traffic Control]. To protect this large transportation network, the TSA employs approximately 48,000 Transportation Security Officers (TSA); who are responsible for implementing security activities at each.

Many people are aware of the common security activities, especially individual passenger screening. However, this is just one of many security layers TSA personnel implement to help prevent potential threats (TSA). These layers can involve hundreds of heterogeneous security activities executed by limited TSA personnel, leading to a complex resource-allocation challenge. Unfortunately, TSA cannot possibly run every security activity all the time and thus must decide how to appropriately allocate its resources among the layers of security activities.

To aid the TSA in scheduling resources in a risk-based manner, we take a multi-agent game-theoretic approach. Motivated by advantages of such an approach reported at AAMAS conferences (see Section 6.2.2), we utilize Stackelberg games, in which one agent (the leader) must commit to some strategy first and a second agent (the follower) can make his decision with knowledge of this commitment. Here, the TSA acts as a defender (i.e., the leader) who has a set of targets to protect, a number of security activities they can utilize to protect each target, and a limited number of resources to assign to these security activities.

Type
Chapter
Information
Security and Game Theory
Algorithms, Deployed Systems, Lessons Learned
, pp. 107 - 128
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

,Air traffic control: By the numbers. In http://www.natca.org/mediacenter/bythenumbers.msp#1.
TSA | Transportation Security Administration | U.S. Department of Homeland Security. In http://www.tsa.gov/.
N., Agmon. On events in multi-robot patrol in adversarial environments. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2010.Google Scholar
N., Agmon, S., Kraus, G., Kaminka, and V., Sadov. Adversarial uncertainty in multi-robot patrol. In International Joint Conference on Artificial Intelligence (IJCAI), 2009.Google Scholar
N., Basilico, N., Gatti, T., Rossi, S., Ceppi, and F., Amigoni. Extending algorithms for mobile robot patrolling in the presence of adversaries to more realistic settings. In IAT, 2009.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
M., Jain, E., Kardes, C., Kiekintveld, M., Tambe, and F., Ordóñez. Security games with arbitrary schedules: A branch and price approach. In National Conference on Artificial Intelligence (AAAI), 2010.Google Scholar
C., Kiekintveld, M., Jain, J., Tsai, J., Pita, M., Tambe, and F., Ordóñez. Computing optimal randomized resource allocations for massive security games. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2009.Google Scholar
D., Korzhyk, V., Conitzer, and R., Parr. Complexity of computing optimal Stackelberg strategies in security resource allocation games. In National Conference on Artificial Intelligence (AAAI), 2010.Google Scholar
R. C., Larson. A hypercube queueing model for facility location and redistricting in urban emergency services. Computers and OR, 1(1):67–95, 1974.Google Scholar
P., Paruchuri, J., Marecki, J., Pearce, 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, M., Tambe, F., Ordonez, and S., Kraus. Security in multiagent systems by policy randomization. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2006.Google Scholar
J., Pita, M., Jain, J., Marecki, F., Ordóñez, C., Portway, M., Tambe, C., Western, P., Paruchuri, and S., Kraus. Deployed ARMOR protection: The application of a game theoretic model for security at the Los Angeles International Airport. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2008.Google Scholar
J., Tsai, S., Rathi, C., Kiekintveld, F., Ordóñez, and M., Tambe. IRIS - a tool for strategic security allocation in transportation networks. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2009.Google Scholar
W. A., Wagenaar. Generation of Random Sequences by Human Subjects: A Critical Survey of Literature. 1972.
Z., Yin, D., Korzhyk, C., Kiekintveld, V., Conitzer, and M., Tambe. Stackelberg vs. Nash in security games: Interchangeability, equivalence, and uniqueness. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2010.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] 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
×