### Abstract

We study a recently developed centrality metric to identify key players in terrorist organisations due to Lindelauf et al. [2013]. This metric, which involves computation of the Shapley value for connectivity games on graphs proposed by Amer and Gimenez [2004], was shown to produce substantially better results than previously used standard centralities. In this paper, we present the first computational analysis of this class of coalitional games, and propose two algorithms for computing Lindelauf et al.'s centrality metric. Our first algorithm is exact, and runs in time linear by number of connected subgraphs in the network. As shown in the numerical simulations, our algorithm identifies key players in the WTC 9/11 terrorist network, constructed of 36 members and 125 links, in less than 40 minutes. In contrast, a general-purpose Shapley value algorithm would require weeks to solve this problem. Our second algorithm is approximate and can be used to study much larger networks.

Original language | English (US) |
---|---|

Title of host publication | IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence |

Pages | 293-301 |

Number of pages | 9 |

State | Published - Dec 1 2013 |

Event | 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013 - Beijing, China Duration: Aug 3 2013 → Aug 9 2013 |

### Other

Other | 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013 |
---|---|

Country | China |

City | Beijing |

Period | 8/3/13 → 8/9/13 |

### Fingerprint

### ASJC Scopus subject areas

- Artificial Intelligence

### Cite this

*IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence*(pp. 293-301)

**Computational analysis of connectivity games with applications to the investigation of terrorist networks.** / Michalak, Tomasz P.; Rahwan, Talal; Jennings, Nicholas R.; Szczepański, Piotr L.; Skibski, Oskar; Narayanam, Ramasuri; Wooldridge, Michael J.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence.*pp. 293-301, 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013, Beijing, China, 8/3/13.

}

TY - GEN

T1 - Computational analysis of connectivity games with applications to the investigation of terrorist networks

AU - Michalak, Tomasz P.

AU - Rahwan, Talal

AU - Jennings, Nicholas R.

AU - Szczepański, Piotr L.

AU - Skibski, Oskar

AU - Narayanam, Ramasuri

AU - Wooldridge, Michael J.

PY - 2013/12/1

Y1 - 2013/12/1

N2 - We study a recently developed centrality metric to identify key players in terrorist organisations due to Lindelauf et al. [2013]. This metric, which involves computation of the Shapley value for connectivity games on graphs proposed by Amer and Gimenez [2004], was shown to produce substantially better results than previously used standard centralities. In this paper, we present the first computational analysis of this class of coalitional games, and propose two algorithms for computing Lindelauf et al.'s centrality metric. Our first algorithm is exact, and runs in time linear by number of connected subgraphs in the network. As shown in the numerical simulations, our algorithm identifies key players in the WTC 9/11 terrorist network, constructed of 36 members and 125 links, in less than 40 minutes. In contrast, a general-purpose Shapley value algorithm would require weeks to solve this problem. Our second algorithm is approximate and can be used to study much larger networks.

AB - We study a recently developed centrality metric to identify key players in terrorist organisations due to Lindelauf et al. [2013]. This metric, which involves computation of the Shapley value for connectivity games on graphs proposed by Amer and Gimenez [2004], was shown to produce substantially better results than previously used standard centralities. In this paper, we present the first computational analysis of this class of coalitional games, and propose two algorithms for computing Lindelauf et al.'s centrality metric. Our first algorithm is exact, and runs in time linear by number of connected subgraphs in the network. As shown in the numerical simulations, our algorithm identifies key players in the WTC 9/11 terrorist network, constructed of 36 members and 125 links, in less than 40 minutes. In contrast, a general-purpose Shapley value algorithm would require weeks to solve this problem. Our second algorithm is approximate and can be used to study much larger networks.

UR - http://www.scopus.com/inward/record.url?scp=84896062539&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84896062539&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9781577356332

SP - 293

EP - 301

BT - IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence

ER -