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.
Computational Social Choice: Parameterized Complexity and Challenges
Related papers
Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).
- Social Choice with Changing Preferences: Representation Theorems and Long-Run Policies (2020)60% match
- Choice Set Optimization Under Discrete Choice Models of Group Decisions (2020)58% match
- Computational Aspects of Equilibria in Discrete Preference Games (2019)58% match
- On Parameterized Complexity of Binary Networked Public Goods Game (2020)58% match
- Preference learning along multiple criteria: A game-theoretic perspective (2021)58% match
- Hedonic Diversity Games: A Complexity Picture with More than Two Colors (2022)57% match
- Efficiency in Random Resource Allocation and Social Choice (2022)57% match
- On the Construction of High Dimensional Simple Games (2016)57% match