Two hardness results for core stability in hedonic coalition formation games
From MaRDI portal
Publication:2446827
DOI10.1016/j.dam.2013.03.003zbMath1285.91040OpenAlexW2144128738MaRDI QIDQ2446827
Gerhard J. Woeginger, Vladimir G. Deǐneko
Publication date: 22 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.03.003
Cooperative games (91A12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Social choice (91B14)
Related Items (1)
Cites Work
- Unnamed Item
- Computing desirable partitions in additively separable hedonic games
- The stability of hedonic coalition structures
- Geometric stable roommates
- Stable marriage with ties and bounded length preference lists
- Nonexistence of stable threesome matchings
- Computational complexity of stable partitions with b-preferences
- Stable partitions with \(\mathcal W\)-preferences
- NP-completeness in hedonic games
- A hardness result for core stability in additive hedonic games
- Core in a simple coalition formation game
- Simple priorities and core stability in hedonic games
- Core Stability in Hedonic Coalition Formation
- The Stable Roommates Problem with Ties
- Three-Dimensional Stabl Matching Problems
- NP-complete stable matching problems
- An efficient algorithm for the “stable roommates” problem
- Hedonic Coalitions: Optimality and Stability
- A New Approach to Stable Matching Problems
- College Admissions and the Stability of Marriage
This page was built for publication: Two hardness results for core stability in hedonic coalition formation games