Efficient Computation of the Shapley Value for Centrality in Networks

  • Karthik V. Aadithya
  • Balaraman Ravindran
  • Tomasz P. Michalak
  • Nicholas R. Jennings
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6484)

Abstract

The Shapley Value is arguably the most important normative solution concept in coalitional games. One of its applications is in the domain of networks, where the Shapley Value is used to measure the relative importance of individual nodes. This measure, which is called node centrality, is of paramount significance in many real-world application domains including social and organisational networks, biological networks, communication networks and the internet. Whereas computational aspects of the Shapley Value have been analyzed in the context of conventional coalitional games, this paper presents the first such study of the Shapley Value for network centrality. Our results demonstrate that this particular application of the Shapley Value presents unique opportunities for efficiency gains, which we exploit to develop exact analytical formulas for Shapley Value based centrality computation in both weighted and unweighted networks. These formulas not only yield efficient (polynomial time) and error-free algorithms for computing node centralities, but their surprisingly simple closed form expressions also offer intuition into why certain nodes are relatively more important to a network.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Suri, N.R., Narahari, Y.: Determining the top-k nodes in social networks using the Shapley Value. In: AAMAS 2008: Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 1509–1512 (2008)Google Scholar
  2. 2.
    Gómez, D., González-Arangüena, E., Manuel, C., Owen, G., Del Pozo, M., Tejada, J.: Centrality and power in social networks: A game theoretic approach. Mathematical Social Sciences 46(1), 27–54 (2003)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Koschützki, D., Lehmann, K.A., Peeters, L., Richter, S., Tenfelde-Podehl, D., Zlotowski, O.: Centrality indices. Network analysis. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol. 3418, pp. 16–61. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Watts, D.J.: Six degrees: The science of a connected age. W.W. Norton & Company, New York (2004)Google Scholar
  5. 5.
    Kempe, D., Kleinberg, J., Tardos, É.: Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127–1138. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Suri, N.R., Narahari, Y.: A Shapley Value based approach to discover influential nodes in social networks. IEEE Transactions on Automation Science and Engineering 99, 1–18 (2010)Google Scholar
  7. 7.
    Deng, X., Papadimitriou, C.: On the complexity of cooperative solution concepts. Mathematics of Operations Research 19(2), 257–266 (1994)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Ieong, S., Shoham, Y.: Marginal contribution nets: a compact representation scheme for coalitional games. In: EC 2005: Proceedings of the Sixth ACM Conference on Electronic Commerce, pp. 193–202 (2005)Google Scholar
  9. 9.
    Bondy, J.A., Murty, U.S.R.: Graph theory and its applications. Macmillan, Basingstoke (1976)MATHGoogle Scholar
  10. 10.
    Gibbons, R.: A primer in game theory. Harvester Wheatsheaf (1994)Google Scholar
  11. 11.
    Bonacich, P.: Power and centrality: A family of measures. American Journal of Sociology 92(5), 1170–1182 (1987)CrossRefGoogle Scholar
  12. 12.
    Valente, T.W.: Social network thresholds in the diffusion of innovations. Social Networks 18(1), 69–89 (1996)CrossRefGoogle Scholar
  13. 13.
    Newman, M.E.J.: Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. Physical Review E, 64(1), 0161321–0161327 (2001)Google Scholar
  14. 14.
    Cormen, T.H.: Introduction to Algorithms. MIT Press, Cambridge (2001)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Karthik V. Aadithya
    • 1
  • Balaraman Ravindran
    • 2
  • Tomasz P. Michalak
    • 3
  • Nicholas R. Jennings
    • 3
  1. 1.The University of CaliforniaBerkeleyUSA
  2. 2.Indian Institute of Technology MadrasIndia
  3. 3.School of Electronics and Computer ScienceUniversity of SouthamptonUK

Personalised recommendations