On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities

DOI10.1016/j.ipl.2012.08.016zbMath1248.68259OpenAlexW2066269429MaRDI QIDQ456174

Lars Bækgaard, Martin Olsen, Torben Tambo

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.08.016

zbMATH Keywords

computational complexitygraph algorithmsadditive hedonic gamesNash stable partitions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Cooperative games (91A12) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing desirable partitions in additively separable hedonic games
• The stability of hedonic coalition structures
• Nash stability in additively separable hedonic games and community structures
• Efficient algorithms for decomposing graphs under degree constraints
• Satisfactory graph partition, variants, and generalizations
• Computational complexity in additive hedonic games
• How easy is local search?
• NP-completeness in hedonic games
• Core in a simple coalition formation game
• The satisfactory partition problem
• Computing Stable Outcomes in Hedonic Games
• COALITION FORMATION GAMES: A SURVEY

This page was built for publication: On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities