Game-Theoretic Centrality of Directed Graph Vertices. / Khitraya, V. A.; Mazalov, V. V.
In: Automation and Remote Control, Vol. 85, No. 2, 2024, p. 225-237.Research output: Contribution to journal › Article › peer-review
}
TY - JOUR
T1 - Game-Theoretic Centrality of Directed Graph Vertices
AU - Khitraya, V. A.
AU - Mazalov, V. V.
PY - 2024
Y1 - 2024
N2 - The paper considers a game theory approach to calculating the centrality value of the vertices in a directed graph, based on the number of vertex occurrences in fixed length paths. It is proposed to define vertex centrality as a solution of a cooperative game, where the characteristic function is given as the number of simple paths of fixed length in subgraphs corresponding to coalitions. The concept of integral centrality is introduced as the value of a definite integral of the payoff function. It is shown that this centrality measure satisfies the Boldi–Vigna axioms.
AB - The paper considers a game theory approach to calculating the centrality value of the vertices in a directed graph, based on the number of vertex occurrences in fixed length paths. It is proposed to define vertex centrality as a solution of a cooperative game, where the characteristic function is given as the number of simple paths of fixed length in subgraphs corresponding to coalitions. The concept of integral centrality is introduced as the value of a definite integral of the payoff function. It is shown that this centrality measure satisfies the Boldi–Vigna axioms.
U2 - 10.1134/S0005117924020061
DO - 10.1134/S0005117924020061
M3 - статья
VL - 85
SP - 225
EP - 237
JO - Automation and Remote Control
JF - Automation and Remote Control
SN - 0005-1179
IS - 2
ER -
ID: 132563109