Forming \(k\) coalitions and facilitating relationships in social networks

DOI10.1016/j.artint.2018.03.004zbMath1451.91155OpenAlexW2791624022MaRDI QIDQ1647520

Liat Sless, Noam Hazon, Sarit Kraus, Michael Wooldridge

Publication date: 26 June 2018

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2018.03.004

zbMATH Keywords

social networkscoalition formationadditively separable hedonic games

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Cooperative games (91A12) Applications of game theory (91A80)

Related Items

Multi-view graph convolutional networks with attention mechanism, Reasoning About Trust and Belief Change on a Social Network: A Formal Approach

Uses Software

• KronFit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing desirable partitions in additively separable hedonic games
• Stability and segregation in group formation
• Network bargaining: using approximate blocking sets to stabilize unstable instances
• Easy and difficult objective functions for max cut
• Coalition structure generation with worst case guarantees
• Solving coalitional resource games
• On core membership testing for hedonic coalition formation games
• Coalition Structure Generation over Graphs
• Stabilizing Network Bargaining Games by Blocking Players
• Reducibility Among Combinatorial Problems
• The Cost of Stability in Coalitional Games
• A Polynomial Algorithm for the k-cut Problem for Fixed k