The University of Southampton
University of Southampton Institutional Repository

Computational Analysis of Connectivity Games with Applications to the Investigation of Terrorist Networks

Computational Analysis of Connectivity Games with Applications to the Investigation of Terrorist Networks
Computational Analysis of Connectivity Games with Applications to the Investigation of Terrorist Networks
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.
978-1-57735-633-2
293-301
Michalak, Tomasz
e24bfee3-bd75-4cca-8220-6f3c2f39dc38
Rahwan, Talal
476029f3-5484-4747-9f44-f63f3687083c
Szczepanski, Piotr L.
85ef6304-0ffd-4462-9422-f52e4d44adc2
Skibski, Oscar
04c368d1-d1e4-4b0a-acc7-0e7be91371c6
Narayanam, Ramasuri
99ad1dcb-bc3d-4cd4-a0b3-a5e7e6708db9
Wooldridge, Michael
94674704-0392-4b93-83db-18198c2cfa3b
Jennings, Nicholas R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Michalak, Tomasz
e24bfee3-bd75-4cca-8220-6f3c2f39dc38
Rahwan, Talal
476029f3-5484-4747-9f44-f63f3687083c
Szczepanski, Piotr L.
85ef6304-0ffd-4462-9422-f52e4d44adc2
Skibski, Oscar
04c368d1-d1e4-4b0a-acc7-0e7be91371c6
Narayanam, Ramasuri
99ad1dcb-bc3d-4cd4-a0b3-a5e7e6708db9
Wooldridge, Michael
94674704-0392-4b93-83db-18198c2cfa3b
Jennings, Nicholas R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30

Michalak, Tomasz, Rahwan, Talal, Szczepanski, Piotr L., Skibski, Oscar, Narayanam, Ramasuri, Wooldridge, Michael and Jennings, Nicholas R. (2013) Computational Analysis of Connectivity Games with Applications to the Investigation of Terrorist Networks. Proc. 23rd International Joint Conference on AI (IJCAI). pp. 293-301 .

Record type: Conference or Workshop Item (Paper)

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.

Text
terrorist-shorter_ijcai_camera_v3.pdf - Author's Original
Download (835kB)
Text
__userfiles.soton.ac.uk_Users_nsc_mydesktop_351020rahwan.pdf - Version of Record
Download (1MB)
Text
__userfiles.soton.ac.uk_Users_nsc_mydesktop_351020datedrahwan.pdf - Version of Record
Restricted to Repository staff only
Request a copy

More information

Published date: 2013
Venue - Dates: Proc. 23rd International Joint Conference on AI (IJCAI), 2013-01-01
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 351020
URI: http://eprints.soton.ac.uk/id/eprint/351020
ISBN: 978-1-57735-633-2
PURE UUID: d6ace976-57e4-4c2c-bb62-e52071a598c8

Catalogue record

Date deposited: 12 Apr 2013 15:38
Last modified: 02 Dec 2019 20:51

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×