论文信息 - Defeating Terrorist Networks with Game Theory

Defeating Terrorist Networks with Game Theory

This column discusses the problem of identifying key members of a terrorist network. Game-theoretic centrality measures offer solutions but also raise computational challenges. The authors present a survey of this work and show how some of the computational challenges can be overcome.

[1] Valdis E. Krebs,et al. Mapping Networks of Terrorist Cells , 2001 .

[2] Nicholas R. Jennings,et al. Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality , 2014, J. Artif. Intell. Res..

[3] Oskar Skibski,et al. Algorithms for the shapley and myerson values in graph-restricted games , 2014, AAMAS.

[4] Herbert Hamers,et al. Cooperative game theoretic centrality analysis of terrorist networks: The cases of Jemaah Islamiyah and Al Qaeda , 2013, Eur. J. Oper. Res..

[5] S. Borgatti,et al. The centrality of groups and classes , 1999 .