The author explores the complexity of hedonic diversity games, providing insights into Nash and individually stable outcomes based on the number of colors and coalition sizes.
Hedonic diversity games present a complex computational challenge with varying numbers of colors, requiring new algorithms to determine stable outcomes.
Hedonic diversity games complexity is comprehensively analyzed through parameterized complexity, providing insights into tractability conditions.