Learn More
We investigate two systems of fully proportional representation suggested by Cham-berlin & Courant and Monroe. Both systems assign a representative to each voter so that the " sum of misrepresentations " is minimized. The winner determination problem for both systems is known to be NP-hard, hence this work aims at investigating whether there are variants of(More)
Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classes of algebraic structures, such as groups, rings, lattices, and so forth. One way to give positive answers to this question is to adapt the original proof to the new setting.(More)
We study the complexity of (approximate) winner determination under Monroe's and Chamberlin-Courant's multiwinner voting rules, where we focus on the total (dis)satisfaction of the voters (the utilitarian case) or the (dis)satisfaction of the worst-off voter (the egalitarian case). We show good approximation algorithms for the satisfaction-based utilitarian(More)
In this paper we show that lobbying in conditions of " direct democracy " is virtually impossible, even in conditions of complete information about voters' preferences, since it would require solving a very computationally hard problem. We use the apparatus of parametrized complexity for this purpose. Countrywide votes on a specific issue are an accepted(More)
The concept of <i>distance rationalizability</i> has several applications within social choice. In the context of voting, it allows one to define ("rationalize") voting rules via a consensus class (roughly, a set of elections in which it is obvious who should win) and a distance function: namely, a candidate is said to be an election winner if it is ranked(More)
A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is to show that a rule satisfies a set of desirable axioms that uniquely identify it. Another is to show that the calculation that it performs is actually maximum likelihood estimation(More)
The goal of this paper is to propose and study properties of multiwinner voting rules (with a particular focus on rules based in some way on single-winner scoring rules). We con-of Chamberlin–Courant's and Monroe's rules, identify two natural approaches to defining multiwinner rules, and show that many of our rules can be captured by one or both of these(More)
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 on real-life preference-aggregation data and on synthetic data, show that even very simple and fast algorithms can in many cases find near-perfect solutions. Our results confirm(More)
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. The total (dis)satisfaction is calculated either as the sum of individual (dis)satisfactions (the(More)