Core Concepts
Hedonic diversity games complexity is comprehensively analyzed through parameterized complexity, providing insights into tractability conditions.
Abstract
The article delves into the complexity of hedonic diversity games, focusing on Nash and individual stability outcomes. It introduces new algorithms and lower bounds to understand the problem's boundaries. The study covers various parameters like the number of colors, coalition size, and agent types. The complexity picture is detailed, showcasing tractable and intractable cases. The algorithms combine branching, ILP formulations, and dynamic programming to solve the problem efficiently.
Stats
여러 색상의 에이전트를 사용하는 함정 기기를 만들 수 있는 경우, 결과는 IS 또는 NS가 아닙니다.
Quotes
"Our Contribution. We obtain new algorithms and lower bounds that paint a comprehensive picture of the complexity of HDG through the lens of parameterized complexity."