The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Computing Optimal Randomized Resource Allocations for Massive Security Games
Abstract
Introduction Providing security for transportation systems, computer networks, and other critical infrastructure is a large and growing problem. Central to many of these security problems is a resource allocation task. For example, a police force may have limited personnel to conduct patrols, operate checkpoints, and conduct random searches. Other scarce resources including bomb-sniffing canines, vehicles, and security cameras. The key question is how to efficiently allocate these resources to protect against a wide variety of potential threats. The adversarial aspect of security domains poses unique challenges for resource allocation. A motivated attacker can gather information about security measures using surveillance and plan more effective attacks. Predictable resource allocations may be exploited by an attacker, greatly reducing resource effectiveness. A better approach for deploying security resources is to use randomization to increase the uncertainty of potential attackers. We develop new computational methods that use game-theoretic analysis to generate optimal randomized resource allocations for security domains. Game theory offers a more sophisticated approach to randomization than simply “rolling dice.” It allows the analyst to factor differential risks and values into the game model, and incorporates game-theoretic predictions of how the attacker will respond to a given security policy. Recent work by Paruchuri et al. uses a game-theoretic approach to create randomized security policies for traffic checkpoints and canine patrols at the Los Angeles International Airport (LAX), which are deployed in the daily airport-security operations (Paruchuri et al., 2008; Pita et al., 2008).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1994) · Cited by 5,513
Dynamic Noncooperative Game Theory
(1982) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6169-7 · Cited by 4,057
(2015) · Adversarial Risk Analysis · doi:10.1201/b18653-3 · Cited by 3,632
Dynamic noncooperative game theory
(1995) · European Journal of Operational Research · doi:10.1016/0377-2217(95)90173-6 · Cited by 1,096
Hicks, J. R., & von Stackelberg, H. (1935) · The Economic Journal · doi:10.2307/2224643 · Cited by 1,037
Computing the optimal strategy to commit to
Conitzer, V., & Sandholm, T. (2006) · Proceedings of the 7th ACM conference on Electronic commerce · doi:10.1145/1134707.1134717 · Cited by 479
Using game theory to analyze wireless ad hoc networks
Srivastava, V. R., Neel, J. O., MacKenzie, A. B., Menon, R., DaSilva, L. A., Hicks, J., Reed, J. H., & Gilles, R. P. (2005) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2005.1593279 · Cited by 477
Game strategies in network security
Lye, K.-W., & Wing, J. M. (2005) · International Journal of Information Security · doi:10.1007/s10207-004-0060-x · Cited by 443
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
Paruchuri, P., Pearce, J. P., Marecki, J., Tambe, M., Ordóñez, F., & Kraus, S. (2008) · doi:10.5555/1402298.1402348 · Cited by 424
Self-citationMulti-agent influence diagrams for representing and solving games
Koller, D., & Milch, B. (2003) · Games and Economic Behavior · doi:10.1016/s0899-8256(02)00544-4 · Cited by 409
Cited by
Game‐theoretic computing in risk analysis
Sahinoglu, M., Cueva‐Parra, L., & Ang, D. (2012) · WIREs Computational Statistics · doi:10.1002/wics.1205 · Cited by 9
Metadata
- Authors
- Kiekintveld, C., Jain, M., Tsai, J., Pita, J., Ordóñez, F., & Tambe, M.
- Venue
- Security and Game Theory
- Publisher
- Cambridge University Press
- Published
- 2011-12-12
- Pages
- 156-176
- OpenAlex
- W2107381919
- Cited by
- 351
- References
- 13
- FWCI
- 167.16
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computing Optimal Randomized Resource Allocations for Massive Security Games. https://app.cochat.ai/papers/10.1017/cbo9780511973031.008
- The paper
- Kiekintveld, C., Jain, M., Tsai, J., Pita, J., Ordóñez, F., & Tambe, M. (2011). Computing Optimal Randomized Resource Allocations for Massive Security Games. Security and Game Theory. https://doi.org/10.1017/cbo9780511973031.008
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.