Geodesic
Importance of agents in networks: clique based game-theoretic approach
Contributions to game theory and management, Tome 15 (2022), pp. 189-199.

Voir la notice de l'article provenant de la source Math-Net.Ru

Centrality measures are commonly used to detect important nodes. There are some metrics that measure a node's connectivity to different communities. This paper extends the standard network centrality measures and proposes to estimate the importance of nodes in network as a solution of a cooperative game. Three ways of defining such cooperative game are introduced. Each of them uses the concept of a clique in graph. Examples are considered.
Keywords: cooperative game, game on graph, Shapley value, clique. 
@article{CGTM_2022_15_a14,
     author = {Juping Li and Anna Tur and Maksim Zavrajnov},
     title = {Importance of agents in networks: clique based game-theoretic approach},
     journal = {Contributions to game theory and management},
     pages = {189--199},
     publisher = {mathdoc},
     volume = {15},
     year = {2022},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CGTM_2022_15_a14/}
}
TY  - JOUR
AU  - Juping Li
AU  - Anna Tur
AU  - Maksim Zavrajnov
TI  - Importance of agents in networks: clique based game-theoretic approach
JO  - Contributions to game theory and management
PY  - 2022
SP  - 189
EP  - 199
VL  - 15
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CGTM_2022_15_a14/
LA  - en
ID  - CGTM_2022_15_a14
ER  - 
%0 Journal Article
%A Juping Li
%A Anna Tur
%A Maksim Zavrajnov
%T Importance of agents in networks: clique based game-theoretic approach
%J Contributions to game theory and management
%D 2022
%P 189-199
%V 15
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CGTM_2022_15_a14/
%G en
%F CGTM_2022_15_a14
Juping Li; Anna Tur; Maksim Zavrajnov. Importance of agents in networks: clique based game-theoretic approach. Contributions to game theory and management, Tome 15 (2022), pp. 189-199. http://geodesic.mathdoc.fr/item/CGTM_2022_15_a14/

[1] del Pozo, M., Manuel, C., Gonzalez-Aranguena, E. and Owen, G., “Centrality in directed social networks. A game theoretic approach”, Social Networks, 33:3 (2011), 191–200 | DOI

[2] Faghani, M. R., “A Study of XSS Worm Propagation and Detection Mechanisms in Online Social Networks”, IEEE Transactions on Information Forensics and Security, 8:11 (2013), 1815–1826 | DOI

[3] Jackson, M. O., Social and Economic Networks, Princeton University Press, Princeton, NJ, USA, 2010 | MR | Zbl

[4] Klein, D. J., “Centrality measure in graphs”, Journal of Mathematical Chemistry, 47 (2010), 1209–1223 | DOI | MR | Zbl

[5] Mazalov, V. V., Avrachenkov, K. E., Trukhina, L. I. and Tsynguev, B. T., “Game-Theoretic Centrality Measures for Weighted Graphs”, Fundamenta Informaticae, 145:3 (2016), 341–358 | DOI | MR | Zbl

[6] Mazalov, V. V. and Khitraya, V. A., “A Modified Myerson Value for Determining the Centrality of Graph Vertices”, Automation and Remote Control, 82:1 (2021), 145–159 | DOI | MR | Zbl

[7] Skibski, O., Michalak, T. and Rahwan, T., “Axiomatic Characterization of Game-Theoretic Network Centralities”, Proceedings of the AAAI Conference on Artificial Intelligence, 31:1 (2017) | DOI | MR

[8] Shapley, L. S., “A value for n-person games”, Contributions to the Theory of Games II, eds. Kuhn, H. and Tucker, A., Princeton University Press, Princeton, 1953, 307–317 | MR

[9] Shapley, L. S., “Cores of convex games”, Int. J. Game Theory, 1 (1971), 11–26 | DOI | MR | Zbl