How long does it take for all users in a social network to choose their communities?

DOI10.1016/j.dam.2019.07.023zbMath1427.91203OpenAlexW2968051463WikidataQ127405719 ScholiaQ127405719MaRDI QIDQ2334040

Guillaume Ducoffe, Augustin Chaintreau, Jean-Claude Bermond, Dorian Mazauric

Publication date: 6 November 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-02264327/file/no-format-01-08-19.pdf

zbMATH Keywords

algorithmsgraphssocial networksinteger partitionscoloring gamescommunities

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Related Items (1)

Non-existence of stable social groups in information-driven networks

Cites Work

• Unnamed Item
• Unnamed Item
• Clustering on \(k\)-edge-colored graphs
• On proportional allocation in hedonic games
• Stable marriage with covering constraints -- a complete computational trichotomy
• Longest chains in the lattice of integer partitions ordered by majorization
• How easy is local search?
• Strategyproof mechanisms for additively separable hedonic games and fractional hedonic games
• The lattice of integer partitions
• NP-completeness in hedonic games
• Simple priorities and core stability in hedonic games
• Information-sharing in social networks
• The Parallel Complexity of Coloring Games
• COALITION FORMATION GAMES: A SURVEY
• A Game Theoretic Approach for Efficient Graph Coloring
• Strategic Coloring of a Graph

This page was built for publication: How long does it take for all users in a social network to choose their communities?