Hedonic diversity games: a complexity picture with more than two colors
From MaRDI portal
Publication:6067039
DOI10.1016/j.artint.2023.104017zbMath1530.91035arXiv2202.09210OpenAlexW4387046870MaRDI QIDQ6067039
Šimon Schierreich, Dušan Knop, Thekla Hamm, Ondřej Suchý, Robert Ganian
Publication date: 14 December 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.09210
Cooperative games (91A12) Matching models (91B68) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- The stability of hedonic coalition structures
- The stable marriage problem with master preference lists
- On simplified group activity selection
- Popularity at minimum cost
- On structural parameterizations of the edge disjoint paths problem
- Price of Pareto optimality in hedonic games
- Schelling games on graphs
- On structural parameterizations of the bounded-degree vertex deletion problem
- Core in a simple coalition formation game
- Pareto optimality in coalition formation
- Multidimensional stable roommates with master list
- Hedonic diversity games revisited
- Group activity selection with few agent types
- Dynamic models of segregation†
- Three-Dimensional Stabl Matching Problems
- Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems
- Hedonic Coalitions: Optimality and Stability
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
- Hedonic Games with Ordinal Preferences and Thresholds
- Stable matching with couples
- Parameterized Algorithms
- College Admissions and the Stability of Marriage
This page was built for publication: Hedonic diversity games: a complexity picture with more than two colors
