Computational Social Choice: Parameterized Complexity and Challenges
Jiehua Chen, Christian Hatschka, Sofia Simola
TL;DR
This paper surveys the parameterized complexity of key problems in computational social choice, specifically Multi-Winner Determination and Hedonic Games, highlighting research challenges and future directions.
Contribution
It provides a comprehensive overview of the parameterized complexity landscape for these problems and identifies open research challenges in the field.
Findings
Analysis of parameterized complexity for Multi-Winner Determination
Analysis of parameterized complexity for Hedonic Games
Identification of key research challenges in the field
Abstract
We survey two key problems-Multi-Winner Determination and Hedonic Games in Computational Social Choice, with a special focus on their parameterized complexity, and propose some research challenges in the field.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOpinion Dynamics and Social Influence