Analyzing the Zerkani network with the Owen value

This paper introduces a new centrality measure based on the Owen value to rank members in covert networks. In particular, we consider the Zerkani network responsible for the Paris attack of November 2015 and the Brussels attack of March 2016. We follow the line of research introduced in Hamers et al. [Handbook of the Shapley value. Taylor and Francis Group: CRC Press, pp 463–481 (2019)]. First, we consider two different appropriate cooperative games defined on the Zerkani network. Both games take into account the strengths of the links between its members and the individual contribution of its members. Second, for each game the Owen value is calculated, that provides a ranking of the members in the Zerkani network. For this calculation, we need to create a suitable partition of the members in the network, and, subsequently, we will use the approximation method introduced in Saavedra-Nieves et al. [The mathematics of the uncertain: A tribute to Pedro Gil. Springer, pp 347–356 (2018)]. Moreover, we can provide specific error bounds for the approximation of the Owen value. Finally, the obtained rankings are compared to the rankings established in Hamers et al. [Handbook of the Shapley value. Taylor and Francis Group: CRC Press, pp 463–481 (2019)]