A Game Theoretic Framework for Community Detection

Abstract

The mainstream approach for community detection focuses on the optimization of a metric that measures the quality of a partition over a given network. Optimizing a global metric is akin to community assignment by a centralized decision maker. In liu of global optimization, we treat each node as a player in a hedonic game and focus on their ability to form fair and stable community structures. Application on real-world networks and a well-known benchmark demonstrates that our approach produces better results than modularity optimization.