Operations Research Transactions ›› 2024, Vol. 28 ›› Issue (4): 123-134.doi: 10.15960/j.cnki.issn.1007-6093.2024.04.012

Previous Articles     Next Articles

Shapley index of the bonding operation on graphs

Qingfeng DONG1, Zhendong GU2, Qianru ZHOU2, Shuming ZHOU2,*()   

  1. 1. School of Economics, Fujian Normal University, Fuzhou 350117, Fujian, China
    2. School of Mathematics and Statistics, Fujian Normal University, Fuzhou 350117, Fujian, China
  • Received:2021-06-18 Online:2024-12-15 Published:2024-12-20
  • Contact: Shuming ZHOU E-mail:zhoushuming@fjnu.edu.cn

Abstract:

How to allocate profit reasonablely is an important issue in cooperative game research. The distribution rule based on Shapley value, proposed by Shapley, the winner of the Nobel Prize in Economics, is the commonly used one in cooperative games. The cooperative game theory on graphs greatly enriches the research methods of game theory, and Shapley value on graphs has been widely applied in node influence, community detection and link prediction of social networks. Shapley distance on graphs is suggested based on Shapley value and it can be used to measure the cost of one vertex to access another one. Analogous to Wiener index and Kirchhoff index in graph theory, a new graph parameter, namely Shapley index, is proposed. In this paper, we establish the analytical expressions of Shapley distance and Shapley index of three kinds of conglutinate graphs, such as friendship graphs, book graphs and generalized rose graphs. These empirical examples provide methodological guidance for the computation of Shapley index of other complex topological structures.

Key words: graph theory, game theory, bonding operation, Shapley distance, Shapley index

CLC Number: