Szczegóły publikacji

Opis bibliograficzny

Bribery as a measure of candidate success: complexity results for approval-based multiwinner rules / Piotr FALISZEWSKI, Piotr Skowron, Nimrod Talmon // W: AAMAS 2017 [Dokument elektroniczny] : sixteenth international conference on Autonomous Agents and Multiagent Systems : 8–12 May 2017, São Paulo, Brazil / eds. S. Das [et al.]. — Wersja do Windows. — Dane tekstowe. — [USA] : International Foundation for Autonomous Agents and Multiagent Systems, cop. 2017. — S. 6–14. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: http://www.aamas2017.org/proceedings/pdfs/p6.pdf [2017-05-26]. — Bibliogr. s. 14, Abstr.

Autorzy (3)

Słowa kluczowe

approval-based votingmulti-winner electionsbribery

Dane bibliometryczne

ID BaDAP105900
Data dodania do BaDAP2017-06-06
Rok publikacji2017
Typ publikacjimateriały konferencyjne (aut.)
Otwarty dostęptak
KonferencjaInternational Joint Conference on Autonomous Agents and Multiagent Systems 2017

Abstract

We study the problem of bribery in multiwinner elections, for the case where the voters cast approval ballots (i.e., sets of candidates they approve) and the bribery actions are limited to: adding an approval to a vote, deleting an approval from a vote, or moving an approval within a vote from one candidate to the other. We consider a number of approval-based multiwinner rules (AV, SAV, GAV, RAV, approval-based Chamberlin–Courant, and PAV). We find the landscape of complexity results quite rich, going from polynomial-time algorithms through NP-hardness with constant-factor approximations, to outright inapproximability. Moreover, in general, our problems tend to be easier when we limit out bribery actions on increasing the number of approvals of the candidate that we want to be in a winning committee (i.e., adding approvals only for this preferred candidate, or moving approvals only to him or her). We also study parameterized complexity of our problems, with a focus on parameterizations by the numbers of voters or candidates.

Publikacje, które mogą Cię zainteresować

fragment książki
#147207Data dodania: 13.6.2023
Bribery can get harder in structured multiwinner approval election / Bartosz Kusek, Robert Bredereck, Piotr FALISZEWSKI, Andrzej KACZMARCZYK, Dušan Knop // W: AAMAS'23 [Dokument elektroniczny] : proceedings of the 2023 international conference on Autonomous Agents and Multiagent Systems : May 29 - June 2, 2023, London, UK / eds. A. Ricci [et al.] ; ACM In-Cooperation, International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). — Wersja do Windows. — Dane tekstowe. — [USA] : ACM DL ; International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), cop. 2023. — e-ISBN: 978-1-4503-9432-1. — S. 1725-1733. — Wymagania systemowe: Adobe Reader. — Bibliogr. s. 1733, Abstr. — Session 5C: Voting I. --- Publikacja dostępna online od: 2023-05-30
fragment książki
#81524Data dodania: 2.6.2014
Properties of multiwinner voting rules / Edith Elkind, Piotr FALISZEWSKI, Piotr Skowron, Arkadii Slinko // W: AAMAS 2014 [Dokument elektroniczny] : proceedings of the 13th international conference on Autonomous Agents and Multiagent Systems : May 5–9, 2014, Paris, France / eds. Alessio Lomuscio, [et al.]. — Wersja do Windows. — Dane tekstowe. — [USA] : International Foundation for Autonomous Agents and Multiagent Systems, cop. 2014. — e-ISBN: 978-1-4503-2738-1. — S. 53–60. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: http://aamas2014.lip6.fr/proceedings/aamas/p53.pdf [2014-05-23]. — Bibliogr. s. 60, Abstr.