Computational Social Choice: Parameterized Complexity and Challenges
Main:5 Pages
1 Figures
2 Tables
Appendix:22 Pages
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.
View on arXiv@article{chen2025_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 on this paper