Stable partitions with \(\mathcal W\)-preferences

DOI10.1016/S0166-218X(03)00464-5zbMath1056.90131MaRDI QIDQ1827807

Jana Hajduková, Katarína Cechlárova

Publication date: 6 August 2004

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

zbMATH Keywords

Polynomial algorithmsNP-completenessStable partitionsStable roommates problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Sensitivity, stability, parametric optimization (90C31)

Related Items (9)

Altruistic Hedonic Games ⋮ COALITION FORMATION GAMES: A SURVEY ⋮ On myopic stability concepts for hedonic games ⋮ On core membership testing for hedonic coalition formation games ⋮ Pareto optimality in coalition formation ⋮ Two hardness results for core stability in hedonic coalition formation games ⋮ Nash stability in additively separable hedonic games and community structures ⋮ Borda-induced hedonic games with friends, enemies, and neutral players ⋮ Computational complexity in additive hedonic games

Cites Work

• Stable marriage and indifference
• Stability in coalition formation games
• Computational complexity of stable partitions with b-preferences
• The Stable Roommates Problem with Ties
• NP-complete stable matching problems
• An efficient algorithm for the “stable roommates” problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Stable partitions with \(\mathcal W\)-preferences