Szczegóły publikacji
Opis bibliograficzny
Robustness of approval-based multiwinner voting rules / Grzegorz GAWRON, Piotr FALISZEWSKI // W: Algorithmic Decision Theory : 6th international conference, ADT 2019 : Durham, NC, USA, October 25–27, 2019 : proceedings / eds. Saša Pekeč, Kristen Brent Venable. — Cham : Springer Nature Switzerland AG, cop. 2019. — (Lecture Notes in Computer Science ; ISSN 0302-9743. Lecture Notes in Artificial Intelligence ; 11834). — ISBN: 978-3-030-31488-0; e-ISBN: 978-3-030-31489-7. — S. 17–31. — Bibliogr. s. 30–31, Abstr. — G. Gawron – dod. afiliacja: VirtusLab, Kraków
Autorzy (2)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 126264 |
|---|---|
| Data dodania do BaDAP | 2019-12-13 |
| Tekst źródłowy | URL |
| DOI | 10.1007/978-3-030-31489-7_2 |
| Rok publikacji | 2019 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Wydawca | Springer |
| Czasopismo/seria | Lecture Notes in Computer Science |
Abstract
We investigate how robust are approval-based multiwinner voting rules to small perturbations of the preference profiles. In particular, we consider the extent to which a committee can change after we add/remove/swap one approval, and we consider the computational complexity of deciding how many such operations are necessary to change the set of winning committees. We also consider the counting variants of our problems, which can be interpreted as computing the probability that the result of an election changes after a given number of random perturbations of the preference profile.