Cooperative Game Theory Approaches for Network Partitioning

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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01560682
Contributor : Konstantin Avrachenkov <>
Submitted on : Thursday, July 27, 2017 - 9:46:55 AM
Last modification on : Thursday, January 11, 2018 - 4:48:44 PM

Files

CSoNet2017_Paper2.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Konstantin Avrachenkov, Aleksei Kondratev, Vladimir 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.1086/jar.33.4.3629752⟩. ⟨hal-01560682v2⟩

Share

Metrics

Record views

244

Files downloads

508