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

DOI10.1007/s00224-022-10089-6zbMath1495.91088OpenAlexW4283833998MaRDI QIDQ2158297

Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric

Publication date: 26 July 2022

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-022-10089-6

zbMATH Keywords

graph theorycoloring gamescomplexity theoryhedonic gamesstable outcomes

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Cooperative games (91A12) Games involving graphs (91A43)

Related Items (1)

Improved Approximations for the Max k-Colored Clustering Problem

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
• Computational complexity in additive hedonic games
• Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
• Strategyproof mechanisms for additively separable hedonic games and fractional hedonic games
• Coalition formation games with separable preferences.
• NP-completeness in hedonic games
• How long does it take for all users in a social network to choose their communities?
• Simple priorities and core stability in hedonic games
• Information-sharing in social networks
• A strategic model of social and economic networks
• The Parallel Complexity of Coloring Games
• NP-complete stable matching problems
• A Game Theoretic Approach for Efficient Graph Coloring
• Strategic Coloring of a Graph
• Distributed Welfare Games
• College Admissions and the Stability of Marriage
• Learning game theory from John Harsanyi

This page was built for publication: Non-existence of stable social groups in information-driven networks