The Complexity of Proportionality Degree in Committee Elections
Lukasz Janeczko, Piotr Faliszewski
Abstract
Over the last few years, researchers have put significant effort into understanding of the notion of proportional representation in committee election. In particular, recently they have proposed the notion of proportionality degree. We study the complexity of computing committees with a given proportionality degree and of testing if a given committee provides a particular one. This way, we complement recent studies that mostly focused on the notion of (extended) justified representation. We also study the problems of testing if a cohesive group of a given size exists and of counting such groups.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itBuilds on2
- An Analysis of Approval-Based Committee Rules for 2D-Euclidean ElectionsMichal Tomasz Godziszewski, Pawel Batko, Piotr Skowron, Piotr FaliszewskiAAAI 2021 · 25 citations
- The Maximin Support Method: An Extension of the D'Hondt Method to Approval-Based Multiwinner ElectionsLuis Sánchez Fernández, Norberto Fernández García, Jesús A. Fisteus, Markus BrillAAAI 2021 · 21 citations
Related papers
- The Price of Justified RepresentationEdith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi et al.AAAI 2022 · 12 citations
- Reconfiguring Proportional CommitteesChris Dong, Fabian Frank, Jannik Peters, Warut SuksompongAAAI 2026 · 1 citation
- Approval-Based Committee Voting under Incomplete InformationAviram Imber, Jonas Israel, Markus Brill, Benny KimelfeldAAAI 2022 · 10 citations
- Electing Successive Committees: Complexity and AlgorithmsRobert Bredereck, Andrzej Kaczmarczyk, Rolf NiedermeierAAAI 2020 · 18 citations
- The Complexity of Subelection Isomorphism ProblemsPiotr Faliszewski, Krzysztof Sornat, Stanislaw SzufaAAAI 2022 · 5 citations
