Szczegóły publikacji
Opis bibliograficzny
Justifying groups in multiwinner approval voting / Edith Elkind, Piotr FALISZEWSKI, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong // Theoretical Computer Science ; ISSN 0304-3975. — 2023 — vol. 969 art. no. 114039, s. 1–17. — Bibliogr. s. 17, Abstr. — Publikacja dostępna online od: 2023-06-20
Autorzy (6)
- Elkind Edith
- AGHFaliszewski Piotr
- Igarashi Ayumi
- Manurangsi Pasin
- Schmidt-Kraepelin Ulrike
- Suksompong Warut
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 150215 |
|---|---|
| Data dodania do BaDAP | 2024-01-04 |
| Tekst źródłowy | URL |
| DOI | 10.1016/j.tcs.2023.114039 |
| Rok publikacji | 2023 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Creative Commons | |
| Czasopismo/seria | Theoretical Computer Science |
Abstract
Justified representation (JR) is a standard notion of representation in multiwinner approval voting. Not only does a JR committee always exist, but previous work has also shown through experiments that the JR condition can typically be fulfilled by groups of fewer than k candidates, where k is the target size of the committee. In this paper, we study such groups—known as n/k-justifying groups—both theoretically and empirically. First, we show that under the impartial culture model, n/k-justifying groups of size less than k/2 are likely to exist, which implies that the number of JR committees is usually large. We then present efficient approximation algorithms that compute a small n/k-justifying group for any given instance, and a polynomial-time exact algorithm when the instance admits a tree representation. In addition, we demonstrate that small n/k-justifying groups can often be useful for obtaining a gender-balanced JR committee even though the problem is NP-hard.