122 citations · 409 across the 73 of their papers we have counts for
5 papers · 1 filter
Multiwinner Elections with Diversity Constraints
Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi +2
We develop a model of multiwinner elections that combines performance-based measures of the quality of the committee (such as, e.g., Borda scores of the committee members) with div…
The Complexity of Multiwinner Voting Rules with Variable Number of Winners
Piotr Faliszewski, Arkadii Slinko, Nimrod Talmon
We consider the approval-based model of elections, and undertake a computational study of voting rules which select committees whose size is not predetermined. While voting rules t…
Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier +2
A classic result of Lenstra [Math.~Oper.~Res.~1983] says that an integer linear program can be solved in fixed-parameter tractable (FPT) time for the parameter being the number of…
Robustness Among Multiwinner Voting Rules
Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk +3
We investigate how robust the results of committee elections are to small changes in the input preference orders, depending on the voting rules used. We find that for typical rules…
The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality
Haris Aziz, Edith Elkind, Piotr Faliszewski +2
We study two notions of stability in multiwinner elections that are based on the Condorcet criterion. The first notion was introduced by Gehrlein: A committee is stable if each com…