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

Tomasz P. Michalak, Talal Rahwan, Nicholas R. Jennings, Piotr L. Szczepański, Oskar Skibski, Ramasuri Narayanam, Michael J. Wooldridge

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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 languageEnglish (US)
    Title of host publicationIJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence
    Pages293-301
    Number of pages9
    StatePublished - Dec 1 2013
    Event23rd International Joint Conference on Artificial Intelligence, IJCAI 2013 - Beijing, China
    Duration: Aug 3 2013Aug 9 2013

    Other

    Other23rd International Joint Conference on Artificial Intelligence, IJCAI 2013
    CountryChina
    CityBeijing
    Period8/3/138/9/13

    Fingerprint

    Computer simulation

    ASJC Scopus subject areas

    • Artificial Intelligence

    Cite this

    Michalak, T. P., Rahwan, T., Jennings, N. R., Szczepański, P. L., Skibski, O., Narayanam, R., & Wooldridge, M. J. (2013). Computational analysis of connectivity games with applications to the investigation of terrorist networks. In 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.

    IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence. 2013. p. 293-301.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Michalak, TP, Rahwan, T, Jennings, NR, Szczepański, PL, Skibski, O, Narayanam, R & Wooldridge, MJ 2013, Computational analysis of connectivity games with applications to the investigation of terrorist networks. in 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.
    Michalak TP, Rahwan T, Jennings NR, Szczepański PL, Skibski O, Narayanam R et al. Computational analysis of connectivity games with applications to the investigation of terrorist networks. In IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence. 2013. p. 293-301
    Michalak, Tomasz P. ; Rahwan, Talal ; Jennings, Nicholas R. ; Szczepański, Piotr L. ; Skibski, Oskar ; Narayanam, Ramasuri ; Wooldridge, Michael J. / Computational analysis of connectivity games with applications to the investigation of terrorist networks. IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence. 2013. pp. 293-301
    @inproceedings{31e1d9519449481baf35ece5a11cb8d1,
    title = "Computational analysis of connectivity games with applications to the investigation of terrorist networks",
    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.",
    author = "Michalak, {Tomasz P.} and Talal Rahwan and Jennings, {Nicholas R.} and Szczepański, {Piotr L.} and Oskar Skibski and Ramasuri Narayanam and Wooldridge, {Michael J.}",
    year = "2013",
    month = "12",
    day = "1",
    language = "English (US)",
    isbn = "9781577356332",
    pages = "293--301",
    booktitle = "IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence",

    }

    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 -