Computing Optimal Randomized Resource Allocations for Massive Security Games

Christopher Kiekintveld, Manish Jain, Jason Tsai, James Pita, Fernando Ordóñez, Milind TambeCambridge 2011 · DOI · OpenAlex

Abstract

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.
BibTeX
@inproceedings{kiekintveld2011computing,
  author = {Christopher Kiekintveld and Manish Jain and Jason Tsai and James Pita and Fernando Ordóñez and Milind Tambe},
  title = {{Computing Optimal Randomized Resource Allocations for Massive Security Games}},
  booktitle = {Cambridge},
  year = {2011},
  doi = {10.1017/cbo9780511973031.008},
}

Loading related content...

Figure