Szczegóły publikacji
Opis bibliograficzny
Achieving fully proportional representation by clustering voters / Piotr FALISZEWSKI, Arkadii Slinko, Kolja Stahl, Nimrod Talmon // W: AAMAS 2016 [Dokument elektroniczny] : Autonomous Agents and Multiagent Systems : international conference : 9–13 May 2016, Singapore / eds. J. Thangarajah [et al.]. — Wersja do Windows. — Dane tekstowe. — [USA] : International Foundation for Autonomous Agents and Multiagent Systems, cop. 2016. — e-ISBN: 978-1-4503-4239-1. — S. 296–304. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: http://trust.sce.ntu.edu.sg/aamas16/pdfs/p296.pdf [2016-04-29]. — Bibliogr. s. 304, Abstr.
Autorzy (4)
- AGHFaliszewski Piotr
- Slinko Arkadii
- Stahl Kolja
- Talmon Nimrod
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 97565 |
|---|---|
| Data dodania do BaDAP | 2016-05-10 |
| Rok publikacji | 2016 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | International Joint Conference on Autonomous Agents and Multiagent Systems 2016 |
Abstract
Both the Chamberlin{Courant and Monroe rules are voting rules solving the problem of so-called fully proportional representation: they select committees whose members rep- resent the voters so that voters' satisfaction with their assigned representatives is maximized. These rules su er from a common disadvantage, being that it is computationally intractable to compute the winning committee exactly. As both of these rules, explicitly or implicitly, partition voters, they can be seen as clustering the voters so that the voters in each group share the same representative. This suggests studying approximation algorithms for these voting rules by means of cluster analysis, which is the subject of this paper. We develop several algorithms based on clustering the voters and analyze their performance experimentally.
