Robustness of approval-based multiwinner voting rules

DOI10.1007/978-3-030-31489-7_2zbMath1431.91140OpenAlexW2979668043MaRDI QIDQ2290364

Piotr Faliszewski, Grzegorz Gawron

Publication date: 27 January 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-31489-7_2

zbMATH Keywords

complexityrobustnessapproval votingmultiwinner voting

Mathematics Subject Classification ID

Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Robustness among multiwinner voting rules

Cites Work

• Unnamed Item
• Unnamed Item
• Finding a collective set of items: from proportional multirepresentation to group recommendation
• The complexity of computing the permanent
• Axiomatic characterization of committee scoring rules
• On the evaluation of election outcomes under uncertainty
• Consistent approval-based multi-winner rules
• Robustness radius for Chamberlin-Courant on restricted domains
• Justified representation in approval-based committee voting
• Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives
• On the complexity of achieving proportional representation
• Properties of multiwinner voting rules
• Approval Balloting for Multi-winner Elections
• On the Computation of Fully Proportional Representation
• Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
• Proportional Approval Voting, Harmonic k-median, and Negative Association
• Parameterized Algorithms
• Robustness among multiwinner voting rules

This page was built for publication: Robustness of approval-based multiwinner voting rules