Achieving fully proportional representation by clustering voters

12Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Both the Chamberlin–Courant and Monroe rules are voting rules that solve the problem of fully proportional representation: given a set of candidates and a set of voters, they select committees of candidates whose members represent the voters so that the voters’ total dissatisfaction is minimized. These two rules suffer from a common disadvantage, namely being computationally intractable. As both the Chamberlin–Courant and Monroe rules, explicitly or implicitly, partition voters so that the voters in each part share the same representative, they can be seen as clustering algorithms. This suggests studying approximation algorithms for these voting rules by means of cluster analysis, which is the subject of this paper. Using ideas from cluster analysis we develop several approximation algorithms for the Chamberlin–Courant and Monroe rules and experimentally analyze their performance. We find that our algorithms are computationally efficient and, in many cases, are able to provide solutions which are very close to optimal.

Cite

CITATION STYLE

APA

Faliszewski, P., Slinko, A., Stahl, K., & Talmon, N. (2018). Achieving fully proportional representation by clustering voters. Journal of Heuristics, 24(5), 725–756. https://doi.org/10.1007/s10732-018-9376-y

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free