Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

The cohesiveness of subgroups in social networks: A view from game theory

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Alba, R. D. (1973). A graph-theoretic definition of a sociometric clique. Journal of Mathematical Sociology, 3, 113–126.

    Article  Google Scholar 

  • Ballester, C., Calvo-Armengol, A., & Zenou, Y. (2005). Who’s who in networks. Wanted: The key player (Working paper).

  • Carron, A. V. (1982). Cohesiveness in sport groups: Implications and considerations. Journal of Sport Psychology, 4, 123–138.

    Google Scholar 

  • Echenique, F., & Fryer, R. G. Jr. (2005). On the measurement of segregation (NBER working paper: W11258).

  • Gómez, D., González-Arangüena, E., Manuel, C., Owen, G., del Pozo, M., & Tejada, J. (2003). Centrality and power in social networks: A game theoretic approach. Mathematical Social Sciences, 46, 27–54.

    Article  Google Scholar 

  • Gross, N., & Martin, W. E. (1952). On group cohesiveness. American Journal of Sociology, 52, 546–554.

    Article  Google Scholar 

  • Harary, F. (1969). Graph Theory. Reading: Addison-Wesley.

    Google Scholar 

  • Myerson, R. B. (1977). Graphs and cooperation in games. Mathematics of Operation Research, 2, 225–229.

    Article  Google Scholar 

  • Slikker, M., & Van den Nouweland, A. (2001). Social and economic networks in cooperative game theory. Norwell: Kluwer Academic.

    Google Scholar 

  • White, D. R., & Harary, F. (2001). The cohesiveness of blocks in Social Networks. Node connectivity and conditional density. Social Metodology, 31, 305–359.

    Article  Google Scholar 

  • Wasserman, S., & Faust, K. (1994). Social networks analysis. Cambridge: Cambridge University Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Daniel Gómez.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gómez, D., González–Arangüena, E., Manuel, C. et al. The cohesiveness of subgroups in social networks: A view from game theory. Ann Oper Res 158, 33–46 (2008). https://doi.org/10.1007/s10479-007-0247-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-007-0247-4

Keywords