122 citations · 409 across the 73 of their papers we have counts for
6 papers · 1 filter
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…
Approximating the MaxCover Problem with Bounded Frequencies in FPT Time
Piotr Skowron, Piotr Faliszewski
We study approximation algorithms for several variants of the MaxCover problem, with the focus on algorithms that run in FPT time. In the MaxCover problem we are given a set N of e…
Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting
Piotr Faliszewski, Yannick Reisch, Jörg Rothe +1
A central theme in computational social choice is to study the extent to which voting systems computationally resist manipulative attacks seeking to influence the outcome of electi…
The Complexity of Fully Proportional Representation for Single-Crossing Electorates
Piotr Skowron, Lan Yu, Piotr Faliszewski +1
We study the complexity of winner determination in single-crossing elections under two classic fully proportional representation rules---Chamberlin--Courant's rule and Monroe's rul…
Weighted Electoral Control
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
Although manipulation and bribery have been extensively studied under weighted voting, there has been almost no work done on election control under weighted voting. This is unfortu…
Achieving Fully Proportional Representation is Easy in Practice
Piotr Skowron, Piotr Faliszewski, Arkadii Slinko
We provide experimental evaluation of a number of known and new algorithms for approximate computation of Monroe's and Chamberlin-Courant's rules. Our experiments, conducted both o…