A Survey of Quantitative Models of Terror Group Behavior and an Analysis of Strategic Disclosure of Behavioral Models

There are many applications (e.g., counter-terrorism) where we can automatically learn a quantitative model from realworld data about terror group behavior. In this paper, we first provide a survey of quantitative models of terrorist groups. To date, however, the best-known quantitative models of terror group behavior are based on various types of quantitative logic programs. After our survey, we address an important question posed to us by Nobel laureate, Tom Schelling. Once a set of quantitative logic behavior rules about an adversary has been learned, should these rules be disclosed or not? We develop a game theoretic framework in order to answer this question with a defender who has to decide what rules to release publicly and which ones to keep hidden. We first study the attacker's optimal attack strategy, given a set of disclosed rules, and then we study the problem of which rules to disclose so that the attacker's optimal strategy has minimal effectiveness. We study the complexity of both problems, present algorithms to solve both, and then present a (1-1/e )-approximation algorithm that (under some restrictions) uses a submodularity property to compute the optimal defender strategy. Finally, we provide experimental results showing that our framework works well in practice-these results are also shown to be statistically significant.

[1]  V. S. Subrahmanian,et al.  Indian Mujahideen: Computational Analysis and Public Policy , 2013 .

[2]  Jana Shakarian,et al.  Computational Analysis of Terrorist Groups: Lashkar-e-Taiba , 2013, Springer New York.

[3]  J. Wilkenfeld,et al.  Ethnic Conflict: An Organizational Perspective , 2013 .

[4]  B. Routray Indian Mujahideen: The Enemy Within , 2012 .

[5]  Wilson John The Caliphate's Soldiers: The Lashkar-e-Tayyeba's Long War , 2011 .

[6]  Daveed Gartenstein-Ross Bin Laden's Legacy: Why We're Still Losing the War on Terror , 2011 .

[7]  Sean P. O'Brien,et al.  Crisis Early Warning and Decision Support: Contemporary Approaches and Thoughts on Future Research , 2010 .

[8]  Ninghui Li,et al.  Towards Formal Verification of Role-Based Access Control Policies , 2008, IEEE Transactions on Dependable and Secure Computing.

[9]  V. S. Subrahmanian,et al.  Stochastic Opponent Modeling Agents: A Case Study with Hezbollah , 2008 .

[10]  Samir Khuller,et al.  Computing most probable worlds of action probabilistic logic programs: scalable estimation for 1030,000 worlds , 2007, Annals of Mathematics and Artificial Intelligence.

[11]  James A. Hendler,et al.  N3Logic: A logical framework for the World Wide Web , 2007, Theory and Practice of Logic Programming.

[12]  Stochastic Opponent Modeling Agents : A Case Study with Hamas , 2008 .

[13]  Diego Reforgiato Recupero,et al.  CARA: A Cultural-Reasoning Architecture , 2007, IEEE Intelligent Systems.

[14]  A. Sliva,et al.  SOMA Models of the Behaviors of Stakeholders in the Afghan Drug Economy: A Preliminary Report , 2007 .

[15]  Ting Yu,et al.  On the modeling and analysis of obligations , 2006, CCS '06.

[16]  Axel Kern,et al.  Rule support for role-based access control , 2005, SACMAT '05.

[17]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[18]  Elisa Bertino,et al.  Association rule hiding , 2004, IEEE Transactions on Knowledge and Data Engineering.

[19]  Joshua M Epstein,et al.  Modeling civil violence: An agent-based computational approach , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[20]  Sean P. O'Brien,et al.  Anticipating the Good, the Bad, and the Ugly , 2002 .

[21]  Timothy R Gulden,et al.  Spatial and temporal patterns in civil violence: Guatemala, 1977–1986 , 2002, Politics and the Life Sciences.

[22]  Sushil Jajodia,et al.  Flexible support for multiple access control policies , 2001, TODS.

[23]  Aaron F. Bobick,et al.  Recognition of Visual Activities and Interactions by Stochastic Parsing , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[24]  V. S. Subrahmanian,et al.  Temporal Probabilistic Logic Programs , 1999, ICLP.

[25]  Vassilios S. Verykios,et al.  Disclosure limitation of sensitive rules , 1999, Proceedings 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX'99) (Cat. No.PR00453).

[26]  U. Feige A threshold of ln n for approximating set cover , 1998, JACM.

[27]  Thomas Lukasiewicz,et al.  Probabilistic Logic Programming , 1998, ECAI.

[28]  M. A. McClure,et al.  Hidden Markov models of biological primary sequence information. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[29]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[30]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[31]  Piero P. Bonissone,et al.  Summarizing and propagating uncertain information with triangular norms , 1990, Int. J. Approx. Reason..

[32]  J. Lloyd Foundations of Logic Programming , 1984, Symbolic Computation.

[33]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[34]  T. Schelling,et al.  The Strategy of Conflict. , 1961 .