No confident code implementation found for this paper.
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.
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
A Parameterized Theory of PAC Learning
Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?
How Complex is your classification problem? A survey on measuring classification complexity
Parameterized Aspects of Distinct Kemeny Rank Aggregation
Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP
@article{chen2024computational,
title = {Computational Social Choice: Parameterized Complexity and Challenges},
author = {Jiehua Chen and Christian Hatschka and Sofia Simola},
year = {2024},
eprint = {2410.14078},
archivePrefix = {arXiv},
url = {http://arxiv.org/abs/2410.14078v2}
}Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/2410.14078)