The University of Southampton
University of Southampton Institutional Repository

Efficient Computation of the Shapley Value for Centrality in Networks

Aadithya, Karthik V., Ravindran, Balaraman, Michalak, Tomasz P. and Jennings, Nicholas R. (2010) Efficient Computation of the Shapley Value for Centrality in Networks At Proc 6th Int Workshop on Internet and Network Economics (WINE 2010). 13 - 18 Dec 2010. , pp. 1-13.

Record type: Conference or Workshop Item (Paper)

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.

PDF Shapley_network_final_short12p.pdf - Accepted Manuscript
Download (263kB)
PDF fulltext2.pdf - Version of Record
Download (242kB)

More information

Published date: 5 October 2010
Additional Information: Event Dates: 13-18 December 2010
Venue - Dates: Proc 6th Int Workshop on Internet and Network Economics (WINE 2010), 2010-12-13 - 2010-12-18
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 271617
URI: http://eprints.soton.ac.uk/id/eprint/271617
PURE UUID: cee4a883-ca38-4662-85a0-0372d6f5d321

Catalogue record

Date deposited: 06 Oct 2010 08:15
Last modified: 18 Jul 2017 06:40

Export record

Contributors

Author: Karthik V. Aadithya
Author: Balaraman Ravindran
Author: Tomasz P. Michalak
Author: Nicholas R. Jennings

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×