82 citations · 299 across the 40 of their papers we have counts for
5 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…
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…
Non-monetary fair scheduling---a cooperative game theory approach
Piotr Skowron, Krzysztof Rzadca
We consider a multi-organizational system in which each organization contributes processors to the global pool but also jobs to be processed on the common resources. The fairness o…
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…