Pith. sign in

REVIEW

Rankings in the Zerkani network by a game theoretical approach

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2202.07730 v1 pith:BJHQ5V5L submitted 2022-02-11 cs.SI math.STstat.TH

Rankings in the Zerkani network by a game theoretical approach

classification cs.SI math.STstat.TH
keywords networkcentralitymeasuresnodesrankingsapproachbanzhafbanzhaf-owen
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper introduces the Banzhaf and Banzhaf-Owen values as novel centrality measures for ranking terrorists in a network. This new approach let integrate the complete topology (i.e. nodes and edges) of the network and a coalitional structure on the nodes of the network. More precisely, the characteristics of the nodes (e.g., terrorists) of the network and their possible relationships (e.g., types of communication links), as well as coalitional information (e.g. level of hierarchies) independent of the network. First, for both centrality measures, we provide approximation algorithms and the corresponding R-codes. Second, as illustration, we rank the members of the Zerkani network, responsible for the attacks in Paris (2015) and Brussels (2016). Finally, we give a comparison between the rankings established by Banzhaf and Banzhaf-Owen and the rankings obtained when using the Shapley value (cf. Hamers et al., 2019) and the Owen value as centrality measures

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.