The Complexity of Proportionality Degree in Committee Elections
Lukasz Janeczko, Piotr Faliszewski
2022年份
4被引次数
1顶会引用
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper2
- An Analysis of Approval-Based Committee Rules for 2D-Euclidean ElectionsMichal Tomasz Godziszewski, Pawel Batko, Piotr Skowron, Piotr FaliszewskiAAAI 2021 · 被引用 25 次
- 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 次
相关 Paper
- The Price of Justified RepresentationEdith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi 等AAAI 2022 · 被引用 12 次
- Reconfiguring Proportional CommitteesChris Dong, Fabian Frank, Jannik Peters, Warut SuksompongAAAI 2026 · 被引用 1 次
- Approval-Based Committee Voting under Incomplete InformationAviram Imber, Jonas Israel, Markus Brill, Benny KimelfeldAAAI 2022 · 被引用 10 次
- Electing Successive Committees: Complexity and AlgorithmsRobert Bredereck, Andrzej Kaczmarczyk, Rolf NiedermeierAAAI 2020 · 被引用 18 次
- The Complexity of Subelection Isomorphism ProblemsPiotr Faliszewski, Krzysztof Sornat, Stanislaw SzufaAAAI 2022 · 被引用 5 次
