Computational Social Choice: Parameterized Complexity and Challenges
Computer Science and Game Theory
2025-06-16 v2 Computational Complexity
Multiagent Systems
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.
Keywords
Cite
@article{arxiv.2410.14078,
title = {Computational Social Choice: Parameterized Complexity and Challenges},
author = {Jiehua Chen and Christian Hatschka and Sofia Simola},
journal= {arXiv preprint arXiv:2410.14078},
year = {2025}
}
Comments
Submitted to Computer Science Review