Szczegóły publikacji
Opis bibliograficzny
Chamberlin-Courant rule with approval ballots: approximating the MaxCover problem with bounded frequencies in FPT time / Piotr Skowron, Piotr FALISZEWSKI // Journal of Artificial Intelligence Research ; ISSN 1076-9757. — 2017 — vol. 60, s. 687–716. — Bibliogr. s. 712–716, Abstr. — Publikacja dostępna online od: 2017-11
Autorzy (2)
- Skowron Piotr
- AGHFaliszewski Piotr
Dane bibliometryczne
| ID BaDAP | 111115 |
|---|---|
| Data dodania do BaDAP | 2018-01-10 |
| Tekst źródłowy | URL |
| DOI | 10.1613/jair.5628 |
| Rok publikacji | 2017 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Journal of Artificial Intelligence Research |
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 and, so, the best polynomial-time approximation algorithm for it has approximation ratio 1 - 1/e. 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.
