Computational Social Choice: Parameterized Complexity and Challenges
arXiv:2410.14078
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.
Submitted to Computer Science Review