Computing optimal randomized resource allocations for massive security games

  title={Computing optimal randomized resource allocations for massive security games},
  author={Christopher Kiekintveld and Manish Jain and Jason Tsai and James Pita and Fernando Ord{\'o}{\~n}ez and Milind Tambe},
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theoretic methods to find optimal randomized security policies, including a fielded application at the Los Angeles International Airport (LAX). This approach has promising applications in many similar domains, including police patrolling for subway and bus systems, randomized baggage screening, and scheduling for the… CONTINUE READING
Highly Influential
This paper has highly influenced 24 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 356 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 230 extracted citations

356 Citations

Citations per Year
Semantic Scholar estimates that this publication has 356 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…