Advertisement

Defending Against Opportunistic Criminals: New Game-Theoretic Frameworks and Algorithms

  • Chao Zhang
  • Albert Xin Jiang
  • Martin B. Short
  • P. Jeffrey Brantingham
  • Milind Tambe
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8840)

Abstract

This paper introduces a new game-theoretic framework and algorithms for addressing opportunistic crime. The Stackelberg Security Game (SSG), which models highly strategic and resourceful adversaries, has become an important computational framework within multiagent systems. Unfortunately, SSG is ill-suited as a framework for handling opportunistic crimes, which are committed by criminals who are less strategic in planning attacks and more flexible in executing them than SSG assumes. Yet, opportunistic crime is what is commonly seen in most urban settings.We therefore introduce the Opportunistic Security Game (OSG), a computational framework to recommend deployment strategies for defenders to control opportunistic crimes. Our first contribution in OSG is a novel model for opportunistic adversaries, who (i) opportunistically and repeatedly seek targets; (ii) react to real-time information at execution time rather than planning attacks in advance; and (iii) have limited observation of defender strategies. Our second contribution to OSG is a new exact algorithm EOSG to optimize defender strategies given our opportunistic adversaries. Our third contribution is the development of a fast heuristic algorithm to solve large-scale OSG problems, exploiting a compact representation.We use urban transportation systems as a critical motivating domain, and provide detailed experimental results based on a real-world system.

Keywords

Full State Stackelberg Game Markov Chain State Ergodic Markov Chain Opportunistic Criminal 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Letchford, J., MacDermed, L., Conitzer, V., Parr, R., Isbell, C.L.: Computing optimal strategies to commit to in stochastic games. In: AAAI (2012)Google Scholar
  2. 2.
    Tambe, M.: Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned. Cambridge University Press (2011)Google Scholar
  3. 3.
    Brantingham, P.J., Tita, G.: Offender mobility and crime pattern formation from first principles. In: Artificial Crime Analysis Systems (2008)Google Scholar
  4. 4.
    Ratcliffe, J.H.: A temporal constraint theory to explain opportunity-based spatial offending patterns. Journal of Research in Crime and Delinquency (2006)Google Scholar
  5. 5.
    See, K.E., Fox, C.R., Rottenstreich, Y.S.: Between ignorance and truth: Partition dependence and learning in judgment under uncertainty. Journal of Experimental Psychology (2006)Google Scholar
  6. 6.
    Hespanha, J.P., Prandini, M., Sastry, S.: Probabilistic pursuit-evasion games: A one-step nash approach (2000)Google Scholar
  7. 7.
    Brantingham, P., Brantingham, P.: Criminality of place. European Journal on Criminal Policy and Research 3(3), 5–26 (1995)CrossRefGoogle Scholar
  8. 8.
    Cornish, D.B., Clarke, R.V.: Understanding crime displacement: An application of rational choice theory. Criminology (1987)Google Scholar
  9. 9.
    Loukaitou-Sideris, A., Liggett, R., Iseki, H.: The geography of transit crime documentation and evaluation of crime incidence on and around the green line stations in Los Angeles. JPER (2002)Google Scholar
  10. 10.
    Qian, Y., Jiang, X., Haskell, W., Tambe, M.: Online planning for optimal protector strategies in resource conservation games. In: AAMAS (2014)Google Scholar
  11. 11.
    Zhu, Q., Clark, A., Poovendran, R., Basar, T.: Deceptive routing games. In: 2012 IEEE 51st Annual Conference on Decision and Control (CDC), pp. 2704–2711. IEEE (2012)Google Scholar
  12. 12.
    Clark, A., Zhu, Q., Poovendran, R., Başar, T.: Deceptive routing in relay networks. In: Grossklags, J., Walrand, J. (eds.) GameSec 2012. LNCS, vol. 7638, pp. 171–185. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  13. 13.
    Basilico, N., Gatti, N., Amigoni, F.: Leader-follower strategies for robotic patrolling in environments with arbitrary topologies. In: AAMAS (2009)Google Scholar
  14. 14.
    Basilico, N., Gatti, N.: Automated abstractions for patrolling security games. In: AAAI (2011)Google Scholar
  15. 15.
    Basilico, N., Gatti, N., Rossi, T., Ceppi, S., Amigoni, F.: Extending algorithms for mobile robot patrolling in the presence of adversaries to more realistic settings. In: Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, vol. 02 (2009)Google Scholar
  16. 16.
    Jiang, A.X., Yin, Z., Zhang, C., Tambe, M., Kraus, S.: Game-theoretic randomization for security patrolling with dynamic execution uncertainty. In: AAMAS (2013)Google Scholar
  17. 17.
    Varakantham, P., Lau, H.C., Yuan, Z.: Scalable randomized patrolling for securing rapid transit networks. In: IAAI (2013)Google Scholar
  18. 18.
    Pita, J., Jain, M., Ordóñez, F., Tambe, M., Kraus, S., Magori-Cohen, R.: Effective solutions for real-world stackelberg games: When agents must deal with human uncertainties. In: AAMAS (2009)Google Scholar
  19. 19.
    Vorobeychik, Y., An, B., Tambe, M.: Adversarial patrolling games. In. In: AAAI Spring Symposium on Security, Sustainability, and Health (2012)Google Scholar
  20. 20.
    Manshaei, M.H., Zhu, Q., Alpcan, T., Bacşar, T., Hubaux, J.P.: Game theory meets network security and privacy. ACM Computing Surveys, CSUR (2013)Google Scholar
  21. 21.
    Zhu, Q., Basar, T.: Dynamic policy-based ids configuration. In: Proceedings of the 48th IEEE Conference on CDC/CCC 2009. IEEE (2009)Google Scholar
  22. 22.
    Nguyen, K.C., Alpcan, T., Basar, T.: Stochastic games for security in networks with interdependent nodes. In: GameNets 2009. IEEE (2009)Google Scholar
  23. 23.
    Short, M.B., D’Orsogna, M.R., Pasour, V.B., Tita, G.E., Brantingham, P.J., Bertozzi, A.L., Chayes, L.B.: A statistical model of criminal behavior. Mathematical Models and Methods in Applied Sciences 18(suppl. 01), 1249–1267 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Zipkin, J.R., Short, M.B., Bertozzi, A.L.: Cops on the dots in a mathematical model of urban crime and police response (2013)Google Scholar
  25. 25.
    Plavnick, A.: The fundamental theorem of markov chains. University of Chicago VIGRE REU (2008)Google Scholar
  26. 26.
    McKelvey, R.D., Palfrey, T.R.: Quantal Response Equilibria for Normal Form Games. Games and Economic Behavior 10(1), 6–38 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    Boyen, X., Koller, D.: Tractable inference for complex stochastic processes. In: UAI, pp. 33–42. Morgan Kaufmann Publishers Inc. (1998)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Chao Zhang
    • 1
  • Albert Xin Jiang
    • 1
  • Martin B. Short
    • 2
  • P. Jeffrey Brantingham
    • 3
  • Milind Tambe
    • 1
  1. 1.University of Southern CaliforniaLos AngelesUSA
  2. 2.Georgia Institute of TechnologyAtlantaUSA
  3. 3.University of CaliforniaLos AngelesUSA

Personalised recommendations