Computational complexity of stable partitions with b-preferences
From MaRDI portal
Publication:1414457
DOI10.1007/s001820200124zbMath1083.91015OpenAlexW2313513701MaRDI QIDQ1414457
Jana Hajduková, Katarína Cechlárova
Publication date: 23 November 2003
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001820200124
Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Altruistic Hedonic Games ⋮ The core of housing markets from an agent's perspective: Is it worth sprucing up your home? ⋮ On core membership testing for hedonic coalition formation games ⋮ Unnamed Item ⋮ The kidney exchange problem: how hard is it to find a donor? ⋮ The computational complexity of rationalizing boundedly rational choice behavior ⋮ Simple priorities and core stability in hedonic games ⋮ Housing markets through graphs ⋮ 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 ⋮ Stable partitions with \(\mathcal W\)-preferences ⋮ Computational complexity in additive hedonic games
