Network partitioning algorithms as cooperative games
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 dense subgraphs inside the network. Here we propose to use the methods of cooperative game theory that highlight not only the...
Main Authors: | Konstantin E. Avrachenkov, Aleksei Y. Kondratev, Vladimir V. Mazalov, Dmytro G. Rubanov |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2018-10-01
|
Series: | Computational Social Networks |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s40649-018-0059-5 |
Similar Items
-
Allocation rules with outside option in cooperation games with time‐inconsistency
by: Harald D. Stein
Published: (2010-03-01) -
Profit-Sharing Rule for Networked Microgrids Based on Myerson Value in Cooperative Game
by: Jeongmeen Suh, et al.
Published: (2021-01-01) -
Cooperation or Localization in European Capacity Markets? A Coalitional Game over Graph Approach
by: Giorgos Stamtsis, et al.
Published: (2018-06-01) -
A Cooperative Game Theory-Based Algorithm for Overlapping Community Detection
by: Xu Zhou, et al.
Published: (2020-01-01) -
Hide and Seek in a Social Network
by: Abrahamsson, Olle
Published: (2017)