no code implementations • 14 Dec 2013 • 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 optimizing the total (dis)satisfaction of the voters with their representatives.