This paper presents a novel approach to efficiently compute semivalues for game-theoretic network centrality analysis. By streamlining the computation process, our method significantly enhances the efficiency of semivalue determination, enabling faster and more scalable analysis of network structures. Leveraging advanced algorithms and optimization techniques, we demonstrate improved performance without compromising accuracy. Our approach holds promise for various applications requiring timely and precise insights into network dynamics and centrality measures.

Semivalue computation, Game theory, Network centrality analysis

Amer, R., & Gim ́enez, J. M. (2004). A connectivity game for graphs.Mathematical Methods ofOperations Research,60(3), 453–470.

Amer, R., Gim ́enez, J., & Maga ̃na, A. (2012). Accessibility measures to nodes of directed graphsusing solutions for generalized cooperative games.Mathematical Methods of OperationsResearch,75(1), 105–134.

Aziz, H., & de Keijzer, B. (2014). Shapley meets Shapley. In Mayr, E. W., & Portier, N. (Eds.),31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014),Vol. 25, pp. 99–111.

Bachrach, Y., & Rosenschein, J. S. (2009). Power in threshold network flow games.AutonomousAgents and Multi-Agent Systems,18(1), 106–132.

Banzhaf, J. F. (1965). Weighted Voting Doesn’t Work: A Mathematical Analysis.Rutgers LawReview,19, 317–343.

Boldi, P., & Vigna, S. (2014). Axioms for centrality.Internet Mathematics,10(3–4).

Bollen, J., Sompel, H. V., Smith, J. A., & Luce, R. (2005). Toward alternative metrics of journal im-pact: A comparison of download and citation data.Information Processing and Management,41(6), 1419–1440.

Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification.Journal of Mathematical Sociology,2(1), 113–120.