[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

A Modified Myerson Value for Determining the Centrality of Graph Vertices

  • MATHEMATICAL GAME THEORY AND APPLICATIONS
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

To analyze the structure of social networks, the methods of cooperative game theory can be adopted. One of such methods is based on the calculation of the Myerson values as a centrality measure of the vertices in a graph. In this case, the number of paths of a certain length in the subgraphs corresponding to the coalitions is used as the characteristic function. This paper proposes a modification of the Myerson value for the case where the paths in a graph containing cycles are included in consideration. The effectiveness of this approach is illustrated by several examples.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.
Fig. 8.

Similar content being viewed by others

REFERENCES

  1. Aumann, R. and Myerson, R., Endogenous Formation of Links between Players and Coalitions: An Application of the Shapley Value, in The Shapley Value, Cambridge: Cambridge Univ. Press, 1988, pp. 175–191.

  2. Avrachenkov, K.E., Kondratev, A.Yu., Mazalov, V.V., and Rubanov, D.G., Network Partitioning as Cooperative Games, Computat. Social Networks, 2018, vol. 5, no. 11, pp. 1–28.

    Google Scholar 

  3. Avrachenkov, K.E., Mazalov, V.V., and Tsynguev, B.T., Beta Current Flow Centrality for Weighted Networks, Proc. 4th Int. Conf. on Computational Social Networks (CSoNet 2015), Lecture Notes in Computer Science, vol. 9197, 2015, pp. 216–227.

  4. Brandes, U. and Fleischer, D., Centrality Measures Based on Current Flow, Proc. 22nd Annual Conf. on Theoretical Aspects of Computer Science (2005), pp. 533–544.

  5. Brin, S. and Page, L., The Anatomy of a Large-Scale Hypertextual Web Search Engine, Comput. Networks ISDN Syst., 1998, vol. 30, no. 17, pp. 107–117.

    Article  Google Scholar 

  6. Freeman, L.C., A Set of Measures of Centrality Based on Betweenness, Sociometry, 1977, vol. 40, pp. 35–41.

    Article  Google Scholar 

  7. Mazalov, V. and Chirkova, J., Networking Games, New York: Academic, 2019.

    MATH  Google Scholar 

  8. Mazalov, V.V. and Trukhina, L.I., Generating Functions and the Myerson Vector in Communication Networks, Discr. Math. Appl., 2014, vol. 24, no. 5, pp. 295–303.

    MathSciNet  MATH  Google Scholar 

  9. Michalak, T.P., Aadithya, K.V., Szczepanski, P.L., Ravindran, B., and Jennings, N.R., Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality, J. Artif. Intell. Res., 2013, vol. 46, pp. 607–650.

    Article  MathSciNet  Google Scholar 

  10. Myerson, R.B., Graphs and Cooperation in Games, Math. Oper. Res., 1977, vol. 2, pp. 225–229.

    Article  MathSciNet  Google Scholar 

  11. Stroeymeyt, N., Grasse, A.V., Crespi, A., Mersch, D.P., Cremer, S., and Keller, L., Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect, Science, 2006, vol. 362, pp. 941–945.

    Article  Google Scholar 

Download references

Funding

This work was partially supported by the “Double Hundred Talent Plan” of Shandong Province, project no. WST2017009.

Author information

Authors and Affiliations

  1. Institute of Applied Mathematical Research, Karelian Research Center, Russian Academy of Sciences, Petrozavodsk, 185910, Russia

    V. V. Mazalov

  2. School of Mathematics and Statistics, Qingdao University, Qingdao, China

    V. V. Mazalov

  3. Institute of Applied Mathematics of Shandong, Qingdao, China

    V. V. Mazalov

  4. Institute of Mathematics and Information Technology, Petrozavodsk State University, Petrozavodsk, 185910, Russia

    V. A. Khitraya

Authors
  1. V. V. Mazalov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. A. Khitraya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to V. V. Mazalov or V. A. Khitraya.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mazalov, V.V., Khitraya, V.A. A Modified Myerson Value for Determining the Centrality of Graph Vertices. Autom Remote Control 82, 145–159 (2021). https://doi.org/10.1134/S0005117921010100

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117921010100

Keywords

Search

Navigation