The position value as a centrality measure in social networks

Thumbnail Image
Official URL
Full text at PDC
Publication Date
Advisors (or tutors)
Journal Title
Journal ISSN
Volume Title
Google Scholar
Research Projects
Organizational Units
Journal Issue
The position value, introduced by Meessen (1988), is a solution concept for cooperative games in which the value assigned to a player depends on the value of the connections or links he has with other players. This concept has been studied by Borm et al. (1992) and characterised by Slikker (2005). In this paper, we analyse the position value from the point of view of the typical properties of a measure of centrality in a social network. We extend the analysis already developed in Gomez et al. (2003) for the Myerson centrality measure, where the symmetric effect on the centralities of the end nodes of an added or removed edge is a fundamental part of its characterisation. However, the Position centrality measure, unlike the Myerson centrality measure, responds in a more versatile way to such addition or elimination. After studying the aforementioned properties, we will focus on the analysis and characterisation of the Position attachment centrality given by the position value when the underlying game is the attachment game. Some comparisons are made with the attachment centrality introduced by Skibski et al. (2019).
[1] Bandyopadhyay, S., Murty, M. N., & Narayanam, R. (2017). A generic axiomatic characterization of centrality measures in social network. arXiv preprint arXiv:1703.07580. [2] Bloch, F., Jackson, M. O. and Tebaldi, P. (2021). Centrality measures in networks. arXiv preprint, arXiv:1608.05845. [3] Bloch, F., Jackson, M. O., & Tebaldi, P. (2016). Centrality measures in networks. arXiv preprint arXiv:1608.05845. [4] Boldi, P., & Vigna, S. (2014). Axioms for centrality. Internet Mathematics, 10(3-4), 222-262. [5] Bonacich, P. (1987). Power and centrality: A family of measures. American journal of sociology 92(5), 1170-1182. [6] Borgatti, S. P. (2003). Identifying sets of key players in a network. In: IEMC’03 Proceedings. Managing Technologically Driven Organizations: The Human Side of Innovation and Change (IEEE Cat. No. 03CH37502), 127-131, IEEE. [7] Borgatti, S. P. and Everett, M. G. (2006). A graph-theoretic perspective on centrality. Social Networks 28(4), 466-484. [8] Borm, P., Owen, G., Tijs, S.H. (1992). On the position value for communication situations. SIAM J. Discrete Math. 5, 305-320. [9] Dietzenbacher, B., Borm, P., Hendrickx R. (2017). Decomposition of network communication games. Mathematical Methods of Operations Research 85: 407-423. [10] Estrada, E. (2006). Virtual identification of essential proteins within the protein interaction network of yeast. Proteomics, 6(1), 35-40. [11] Freeman, L.C. (1979). Centrality in social networks: conceptual clarification. Social Networks 1, 215-239. [12] Friedkin, N. E. (1991). Theoretical foundations for centrality measures. American Journal of Sociology 96(6), 1478-1504. [13] Garg, M. (2009). Axiomatic foundations of centrality in networks. Available at SSRN 1372441. [14] Girvan, M. and Newman, M. E. J. (2002). Community structure in social and biological networks. Proc. Natl Acad. Sci. USA 99, 7821-7826. [15] Gómez, D., González-Arangüena, E., Manuel, C., Owen, G., del Pozo, M. and Tejada, J. ¨(2003). Centrality and power in social networks: a game theoretic approach. Mathematical Social Sciences 46, 27-54. [16] Gómez, D., González-Arangüena, E., Manuel, C., Owen, G., & del Pozo, M. (2004). A unified ¨approach to the Myerson value and the position value. Essays in Cooperative Games: In Honor of Guillermo Owen, 63-76. [17] Gofman, M. (2017). Efficiency and stability of a financial architecture with too-interconnected-to-fail institutions. Journal of Financial Economics 124(1), 113-146. [18] Grofman, B., Owen, G. (1982). A game-theoretic approach to measuring centrality in social networks. Social Networks 4, 213-224. [19] Hajian, M., Melachrinoudis, E., & Kubat, P. (2016). Modeling wildfire propagation with the stochastic shortest path: A fast simulation approach. Environmental modelling & software, 82, 73-88. [20] Harsanyi, J.C. A bargaining model for cooperative n-person games. In Contributions to the Theory of Games IV; Tucker, A.W., Luce, R.D., Eds.; Priceton University Press: Princeton, NJ, USA, 1959; pp. 325-355. [21] Horvath, S. (2011). Weighted network analysis: applications in genomics and systems biology. Springer Science & Business Media. [22] Katz, L. (1953). A new status index derived from sociometric analysis. Psychometrika 18(1), 39-43. [23] Landherr, A., Friedl, B., & Heidemann, J. (2010). A critical review of centrality measures in social networks. Wirtschaftsinformatik, 52, 367-382. [24] Lindelauf, R. H., Hamers, H. J., & Husslage, B. G. M. (2013). Cooperative game theoretic centrality analysis of terrorist networks: The cases of jemaah islamiyah and al qaeda. European Journal of Operational Research, 229(1), 230-238. [25] Manuel, C., Ortega, E., del Pozo, M. (2020). Marginality and Myerson values. European Journal of Operational Research, 284(1), 301-312. [26] Manuel, C., Ortega, E., del Pozo, M. (2022). Marginality and the position value. TOP, 1-16. [27] Meessen, R. Communication Games (in Dutch). Master’s Thesis, Department of Mathematics, University of Nijmegen, The Netherlands, 1988. [28] Musegaas, M., Dietzenbacher, B. J., & Borm, P. E. (2016). On Shapley ratings in brain networks. Frontiers in neuroinformatics, 10, 51. [29] Myerson, R. (1977). Graphs and cooperation in games. Mathematics of Operations Research 2, 225-229. [30] Narayanam, R. and Narahari, Y. (2010). A Shapley value-based approach to discover influential nodes in social networks. IEEE Transactions on Automation Science and Engineering, 8(1), 130-147. [31] Newman, M. E. (2005). A measure of betweenness centrality based on random walks. Social Networks 27(1), 39-54. [32] Owen, G. (1986). Values of graph-restricted games. SIAM Journal on Algebraic Discrete Methods, 7(2), 210-220. [33] del Pozo, M., Manuel, C., Gonzalez-Arang ´ uena, E., & Owen, G. (2011). Centrality in directed ¨social networks. A game theoretic approach. Social Networks, 33(3), 191-200. [34] Sabidussi, G. (1966). The centrality index of a graph. Psychometrika 31(4), 581-603. [35] Shapley, L. S. (1953). A Value for n-Person Games. In: Contributions to the Theory of Games II (Annals of Mathematics Studies 28); H. W. Kuhn and A. W. Tucker (eds.). Princeton University Press, 307-317. [36] Skibski, O., Michalak, T. P., & Rahwan, T. (2018). Axiomatic characterization of gametheoretic centrality. Journal of Artificial Intelligence Research, 62, 33-68. [37] Skibski, O., Rahwan, T., Michalak, T.P., Yokoo, M. (2019). Attachment centrality: Measure for connectivity in networks. Artificial Intelligence 274, 151-179. [38] Slikker, M. (2005). A characterization of the position value. International Journal of Game Theory 33 (4), 505-514. [39] Tarkowski, M. K., Michalak, T. P., Rahwan, T. and Wooldridge, M. (2017). Game-theoretic network centrality: A review. arXiv preprint arXiv:1801.00218. [40] Weber, R.J. (1988). Probabilistic values for games. In: The Shapley Value: Essays in Honor of Lloyd S. Shapley; Roth, A (Ed.). Cambridge University Press, pp. 101-119. [41] Zubiaga, A., Aker, A., Bontcheva, K., Liakata, M., & Procter, R. (2018). Detection and resolution of rumours in social media: A survey. ACM Computing Surveys (CSUR), 51(2), 1-36.