Szczegóły publikacji
Opis bibliograficzny
Fully proportional representation with approval ballots: approximating the MaxCover problem with bounded frequencies in FPT time / Piotr Skowron, Piotr FALISZEWSKI // W: Proceedings of the twenty-ninth AAAI conference on Artificial intelligence [Dokument elektroniczny] : January 25–30, 2015, Austin, Texas, USA, Vol. 3. — Wersja do Windows. — Dane tekstowe. — [USA : AAAI Press], [2015]. — Dod. ISBN 978-1-57735-698-1. — e-ISBN: 978-1-57735-701-8. — S. 2124–2130. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: http://www.aaai.org/Press/Proceedings/aaai15.php [2015-06-11]. — Bibliogr. s. 2130, Abstr. — Tekst dostępny po zalogowaniu
Autorzy (2)
- Skowron Piotr
- AGHFaliszewski Piotr
Dane bibliometryczne
| ID BaDAP | 89646 |
|---|---|
| Data dodania do BaDAP | 2015-07-07 |
| Rok publikacji | 2015 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | National Conference of the American Association for Artificial Intelligence 2015 |
Abstract
We consider the problem of winner determination under Chamberlin-Courant's multiwinner voting rule with approval utilities. This problem is equivalent to the well-known NP-complete MaxCover problem (i.e., a version of the SetCover problem where we aim to cover as many elements as possible) and, so, the best polynomial-time approximation algorithm for it has approximation ratio 1 - 1/ℓ. We show exponential-time/FPT approximation algorithms that, on one hand, achieve arbitrarily good approximation ratios and, on the other hand, have running times much better than known exact algorithms. We focus on the cases where the voters have to approve of at most/at least a given number of candidates. © Copyright 2015, Association for the Advancement of Artificial Intelligence (www.aaa1.org). All rights reserved.
