Cooperative Game Theory Approaches for Network Partitioning - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Cooperative Game Theory Approaches for Network Partitioning

(1) , (2) , (2)
1
2

Abstract

The paper is devoted to game-theoretic methods for community detection in networks. The traditional methods for detecting community structure are based on selecting denser subgraphs inside the network. Here we propose to use the methods of cooperative game theory that highlight not only the link density but also the mechanisms of cluster formation. Specifically, we suggest two approaches from cooperative game theory: the first approach is based on the Myerson value, whereas the second approach is based on hedonic games. Both approaches allow to detect clusters with various resolution. However, the tuning of the resolution parameter in the hedonic games approach is particularly intuitive. Furthermore, the modularity based approach and its generalizations can be viewed as particular cases of the hedonic games.
Fichier principal
Vignette du fichier
CSoNet2017_Paper2.pdf (533.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01560682 , version 1 (11-07-2017)
hal-01560682 , version 2 (27-07-2017)

Identifiers

Cite

Konstantin Avrachenkov, Aleksei Yu Kondratev, Vladimir V Mazalov. Cooperative Game Theory Approaches for Network Partitioning. CSoNet 2017 - The 6th International Conference on Computational Social Networks, Aug 2017, Hong Kong, Hong Kong SAR China. ⟨10.1007/978-3-319-62389-4_49⟩. ⟨hal-01560682v2⟩
189 View
554 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More