122 citations · 409 across the 73 of their papers we have counts for
5 papers · 1 filter
Algorithms for Destructive Shift Bribery
Andrzej Kaczmarczyk, Piotr Faliszewski
We study the complexity of Destructive Shift Bribery. In this problem, we are given an election with a set of candidates and a set of voters (each ranking the candidates from the b…
A Framework for Approval-based Budgeting Methods
Piotr Faliszewski, Nimrod Talmon
We define and study a general framework for approval-based budgeting methods and compare certain methods within this framework by their axiomatic and computational properties. Furt…
Complexity of Shift Bribery in Committee Elections
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier +1
Given an election, a preferred candidate p, and a budget, the SHIFT BRIBERY problem asks whether p can win the election after shifting p higher in some voters' preference orders. O…
Elections with Few Voters: Candidate Control Can Be Easy
Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier +1
We study the computational complexity of candidate control in elections with few voters, that is, we consider the parameterized complexity of candidate control in elections with re…
Achieving Fully Proportional Representation: Approximability Results
Piotr Skowron, Piotr Faliszewski, Arkadii Slinko
We study the complexity of (approximate) winner determination under the Monroe and Chamberlin--Courant multiwinner voting rules, which determine the set of representatives by optim…