Achieving fully proportional representation by clustering voters

Piotr Faliszewski, Arkadii Slinko, Kolja Stahl, Nimrod Talmon

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

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.

Original languageEnglish
Pages (from-to)725-756
Number of pages32
JournalJournal of Heuristics
Volume24
Issue number5
DOIs
StatePublished - 1 Oct 2018

Keywords

  • Clustering
  • Fully proportional representation
  • Multiwinner elections
  • Voting

Fingerprint

Dive into the research topics of 'Achieving fully proportional representation by clustering voters'. Together they form a unique fingerprint.

Cite this