@article{0afd492b41e148019f271ee9e1f03a87,
title = "Efficiently computing the Shapley value of connectivity games in low-treewidth graphs",
abstract = "The Shapley value is the solution concept in cooperative game theory that is most used in both theoretical and practical settings. Unfortunately, in general, computing the Shapley value is computationally intractable. This paper focuses on computing the Shapley value of (weighted) connectivity games. For these connectivity games, which are defined on an underlying (weighted) graph, computing the Shapley value is #P-hard, and thus (likely) intractable even for graphs with a moderate number of vertices. We present an algorithm that can efficiently compute the Shapley value if the underlying graph has bounded treewidth. Next, we apply our algorithm to several real-world (covert) networks. We show that our algorithm can quickly compute exact Shapley values for these networks, whereas in prior work these values could only be approximated using a heuristic method. Finally, it is demonstrated that our algorithm can also efficiently compute the Shapley value time for several larger (artificial) benchmark graphs from the PACE 2018 challenge.",
keywords = "Centrality, Social network analysis, Treewidth, Graph theory, Game theory, NETWORK ANALYSIS",
author = "{van der Zanden}, T.C. and H.L. Bodlaender and H.J.M. Hamers",
note = "data source: data was used from the following papers: Krebs VE (2002) Mapping networks of terrorist cells. Connections 24(3):43–52 Gutfraind A, Genkin M (2017) A graph database framework for covert network analysis: an application to the Islamic State network in Europe. Soc Netw 51:178–188 Weeks MR, Clair S, Borgatti SP, Radda K, Schensul JJ (2002) Social networks of drug users in high-risk sites: finding the connections. AIDS Behav 6(2):193–206 Descormiers K, Morselli C (2011) Alliances, conflicts, and contradictions in Montreal{\textquoteright}s street gang landscape. Int Crim Justice Rev 21(3):297–314 UCINET (2018) Italian Gangs network. UCINET website, https://sites.google.com/site/ucinetsoftware/datasets/covert-networks/italian-gangs. Accessed 27 Sep, 2021 Bonnet {\'E}, Sikora F (2019) The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration. In: Paul C, Pilipczuk M (eds) 13th International symposium on parameterized and exact computation (IPEC 2018), volume 115 of Leibniz international proceedings in informatics (LIPIcs), Dagstuhl. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Germany, pp 26:1–26:15",
year = "2023",
month = mar,
day = "1",
doi = "10.1007/s12351-023-00742-4",
language = "English",
volume = "23",
journal = "Operational Research",
issn = "1109-2858",
publisher = "Springer Verlag",
number = "1",
}