Centrality in directed social networks. A game theoretic approach
Social NetworksPublished 10 May 2011
Mónica del Pozo, Conrado Manuel, Enrique González–Arangüena, Guillermo Owen
Citations61
SJR quartileQ1
SJR score1.17
SNIP1.50
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A family of centrality measures for directed social networks from a game theoretical point of view is defined and a characterization of the measures and an additive decomposition in three summands that can be interpreted in terms of emission, betweenness and reception centrality components.
Abstract
In this paper we define a family of centrality measures for directed social networks from a game theoretical point of view. We follow the line started in our previous paper (Gómez et al., 2003) and, besides the definition, we obtain a characterization of the measures and an additive decomposition in three summands that can be interpreted in terms of emission, betweenness and reception centrality components.
Keywords
Decision SciencesPhysics and Astronomy
Social NetworksCentrality in social networks conceptual clarification
16,883 Citations1978Linton C. Freeman
Three distinct intuitive conceptions of centrality are uncovered and existing measures are refined to embody these conceptions, one absolute and one relative measure of the centrality of positions in a network and one reflecting the degree of centralization of the entire network.
Computer Networks and ISDN SystemsThe anatomy of a large-scale hypertextual Web search engine
15,828 Citations1998Sergey Brin, Lawrence M. Page
This paper provides an in-depth description of Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and looks at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want.
SociometryA Set of Measures of Centrality Based on Betweenness
10,249 Citations1977Linton C. Freeman
A family of new measures of point and graph centrality based on early intuitions of Bavelas (1948) is introduced, used to index centrality in any large or small network of symmetrical relations, whether connected or unconnected.
American Journal of SociologyPower and Centrality: A Family of Measures
5,205 Citations1987Phillip Bonacich
Cambridge University Press eBooksA value for <i>n</i>-person games
5,046 Citations1988Lloyd S. Shapley
Journal of Mathematical SociologyFactoring and weighting approaches to status scores and clique identification
3,129 Citations1972Phillip Bonacich
Social NetworksCentrality and network flow
3,061 Citations2005Stephen P. Borgatti
A key claim made in this paper is that centrality measures can be regarded as generating expected values for certain kinds of node outcomes given implicit models of how traffic flows, and that this provides a new and useful way of thinking about centrality.
Centrality and network flow
1,739 Citations2005Stephen P. Borgatti
Mathematics of Operations ResearchGraphs and Cooperation in Games
1,463 Citations1977Roger B. Myerson
Graph-theoretic ideas are used to analyze cooperation structures in games, and fair allocation rules are proven to be unique, closely related to the Shapley value, and stable for a wide class of games.
Social NetworksRethinking centrality: Methods and examples
987 Citations1989Karen Stephenson, Marvin Zelen
Communication Networks
708 Citations2010John M. Levine, Michael A. Hogg
Systems Research and Behavioral ScienceAn improved index of centrality
531 Citations1965Murray A. Beauchamp
The author proposes an improvement of the Bavelas measure of centrality for both points and graphs in order to extend its analytical utility.
A Simplified Bargaining Model for the n-Person Cooperative Game
315 Citations1982John C. Harsanyi
The bargaining model I propose to discuss in this paper2 is a simplified and, as I hope, improved version of my bargaining model published in the Princeton Contributions.
Social NetworksBetweenness centrality measures for directed graphs
312 Citations1994Dougľas R. White, Stephen P. Borgatti
This paper generalizes Freeman’s geodesic centrality measures for betweenness on undirected graphs to the more general directed case, and defines the measures of this concept of graph centralization in terms of the dominance of the most central point.
International Journal of Game TheoryThe Shapley value for cooperative games under precedence constraints
264 Citations1992Ulrich Faigle, Walter Kern
International Journal of Game TheoryGames with permission structures: The conjunctive approach
244 Citations1992Robert P. Gilles, Guillermo Owen +1 more
Mathematical Social SciencesCentrality and power in social networks: a game theoretic approach
211 Citations2003Daniel Gómez, Enrique González–Arangüena +4 more
A new family of centrality measures, based on game theoretical concepts, is proposed for social networks to reflect the interests that motivate the interactions among individuals in a network, and the graph-restricted game is obtained.
Theory and decision library. Series C, Game theory, mathematical programming and operations researchSocial and Economic Networks in Cooperative Game Theory
184 Citations2001Marco Slikker, Anne van den Nouweland
This chapter discusses social and economic networks in Cooperative Situations and a one-Stage model of Network Formation and Payoff Division and Variants on the Basic Model.
International Journal of Game TheoryAn axiomatization of the disjunctive permission value for games with a permission structure
119 Citations1997René van den Brink
An axiomatic characterization of thejunctive permission value being the Shapley value of a modified game in which it is assumed that each player needs permission from at least one of his predecessors before he can act.
Social NetworksEntropy as a measure of centrality in networks characterized by path-transfer flow
119 Citations2006Frank Tutzauer
An entropy-based measure of centrality appropriate for traffic that propagates by transfer and flows along paths is proposed and can be applied to most network types, whether binary or weighted, directed or undirected, connected or disconnected.
Social NetworksMeasuring domination in directed networks
117 Citations2000René van den Brink, Robert P. Gilles
Two relational power measures, the β - measure and the score-measure, are axiomatically characterized and applied to weighted directed networks that can be interpreted as dominance structures which dominance relations are assigned weights representing the ‘importance’ of each relation.
International Journal of Game TheoryThe selectope for cooperative games
90 Citations2000Jean Derks, Hans Haller +1 more
The selectope of a cooperative transferable utility game is the convex hull of the payoff vectors obtained by assigning the Harsanyi dividends of the coalitions to members determined by so-called selectors, and is studied from a set-theoretic point of view, as superset of the core and of the Weber set.
Social NetworksA game theoretic approach to measuring degree of centrality in social networks
77 Citations1982Bernard Grofman, Guillermo Owen
Games and Economic BehaviorThe Shapley Value for n-Person Games in Generalized Characteristic Function Form
76 Citations1994Andrzej S. Nowak, Tadeusz Radzik
Theory and DecisionDigraph Competitions and Cooperative Games
41 Citations2002René van den Brink, Peter Borm
Theory and DecisionCharacterizations of the β- and the Degree Network Power Measure
31 Citations2007René van den Brink, Peter Borm +2 more
OR SpectrumOn values for generalized characteristic functions
29 Citations1997Estela Sánchez-Rodríguez, Gustavo Bergantiños
Mathematical Social SciencesDirected networks, allocation properties and hierarchy formation
21 Citations2004Marco Slikker, Robert P. Gilles +2 more
It is shown that such allocation rules exist if and only if the authors restrict ourselves to a class of weakly hierarchical networks, and strengthening the hierarchical payoff property provides a similar result regarding the class of (strongly) hierarchical networks.
European Journal of Operational ResearchAccessibility in oriented networks
13 Citations2006Rafael Amer Ramon, José Miguel Giménez +1 more
The proposed concept of accessibility tries to conjugate the marginal contributions of each node as a game player with the cooperation geometry imposed by the digraph that models the network.
Games and Economic BehaviorThe vector lattice structure of the n-person TU games
12 Citations2005Francesc Llerena, Carles Rafels
It is shown that any cooperative TU game is the maximum of a finite collection of a specific class of the convex games: the almost positive games, and the class of modular games is a set of generators of the distributive lattice of all Cooperative TU games.
Physica A Statistical Mechanics and its ApplicationsCentrality properties of directed module members in social networks
11 Citations2008Péter Pollner, Gergely Palla +5 more
This work investigates the centrality properties of directed module members in social networks obtained from e-mail exchanges and from sociometric questionnaires and results indicate that nodes in the overlaps between modules play a central role in the studied systems.
SSRN Electronic JournalA Value for Directed Communication Situations
6 Citations2008Enrique González–Arangüena, Conrado Manuel +2 more
An extension of the model of restricted communication in cooperative games as introduced in Myerson (1977) by allowing communication links to be directed and the worth of a coalition to depend on the order in which the players enter the coalition is introduced.
Social NetworksThe VL control measure for symmetric networks
6 Citations2008Ruud Hendrickx, Peter Borm +2 more
It turns out that the VL control measure is a particular proper Shapley value of the associated cooperative network game and is related to optimal strategies in an associated matrix search game.
The B E Journal of Theoretical EconomicsConnectivity and Allocation Rule in a Directed Network
3 Citations2008Jeong-Yoo Kim, Tackseung Jun
SSRN Electronic JournalThe Restricted Core for Totally Positive Games with Ordered Players
2 Citations2009René van den Brink, Gerard van der Laan +1 more