The cohesiveness of subgroups in social networks: a view from game theory
Loading...
Official URL
Full text at PDC
Publication date
2007
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Citation
Gómez, D. et al. (2008) «The cohesiveness of subgroups in social networks: A view from game theory», en Annals of Operations Research. Kluwer Academic Publishers, pp. 33-46. doi:10.1007/S10479-007-0247-4
Abstract
A family of cohesiveness measures, based on game theoretical concepts, is proposed for subgroups in social networks. Given a communication situation, consisting of a coalitional game and a graph, both defined on the same set of players-nodes, cohesiveness of a subset is defined as the proportion of their worth that the players in subset retain, when the originally deterministic (restricted) graph becomes a probabilistic one (in a specific manner). Conditions on the game are given to reach some desirable properties.