Forming \(k\) coalitions and facilitating relationships in social networks
type: Item
instance of: scholarly article
title: Forming \(k\) coalitions and facilitating relationships in social networks
zbMATH Open document ID: 1451.91155
author: Liat Sless
author: Noam Hazon
author: Sarit Kraus
author: M. J. Wooldridge
published in: Artificial Intelligence
publication date: 2018-06-26T00:00:00Z
Mathematics Subject Classification ID: 91D30
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 6894619
zbMATH Keywords: coalition formation
zbMATH Keywords: additively separable hedonic games
zbMATH Keywords: social networks
describes a project that uses: KronFit
MaRDI profile type: Publication
full work available at URL: j.artint.2018.03.004
OpenAlex ID: W2791624022
cites work: Stabilizing Network Bargaining Games by Blocking Players
cites work: Computing desirable partitions in additively separable hedonic games
cites work: The Cost of Stability in Coalitional Games
cites work: Q3619797
cites work: Q4393480
cites work: Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems
cites work: Solving coalitional resource games
cites work: Q4198056
cites work: A Polynomial Algorithm for the k-cut Problem for Fixed k
cites work: Reducibility Among Combinatorial Problems
cites work: Q3549713
cites work: Network bargaining: using approximate blocking sets to stabilize unstable instances
cites work: Introduction to algorithms
cites work: Kronecker graphs: an approach to modeling networks
cites work: Easy and difficult objective functions for max cut
cites work: Stability and segregation in group formation
cites work: Coalition structure generation with worst case guarantees
cites work: On core membership testing for hedonic coalition formation games
cites work: Coalition Structure Generation over Graphs
Wikidata QID: Q130107104
DOI: 10.1016/J.ARTINT.2018.03.004
description: scientific article; zbMATH DE number 6894619