Bribery Can Get Harder in Structured Multiwinner Approval Election

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Kusek, Bartosz, Bredereck, Robert, Faliszewski, Piotr, Kaczmarczyk, Andrzej, Knop, Dušan
Formato: Preprint
Publicado: 2022
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866916098747662336
author Kusek, Bartosz
Bredereck, Robert
Faliszewski, Piotr
Kaczmarczyk, Andrzej
Knop, Dušan
author_facet Kusek, Bartosz
Bredereck, Robert
Faliszewski, Piotr
Kaczmarczyk, Andrzej
Knop, Dušan
contents We study the complexity of constructive bribery in the context of structured multiwinner approval elections. Given such an election, we ask whether a certain candidate can join the winning committee by adding, deleting, or swapping approvals, where each such action comes at a cost and we are limited by a budget. We assume our elections to either have the candidate interval or the voter interval property, and we require the property to hold also after the bribery. While structured elections usually make manipulative attacks significantly easier, our work also shows examples of the opposite behavior. We conclude by presenting preliminary insights regarding the destructive variant of our problem.
format Preprint
id arxiv_https___arxiv_org_abs_2209_00368
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Bribery Can Get Harder in Structured Multiwinner Approval Election
Kusek, Bartosz
Bredereck, Robert
Faliszewski, Piotr
Kaczmarczyk, Andrzej
Knop, Dušan
Computer Science and Game Theory
F.2.2
We study the complexity of constructive bribery in the context of structured multiwinner approval elections. Given such an election, we ask whether a certain candidate can join the winning committee by adding, deleting, or swapping approvals, where each such action comes at a cost and we are limited by a budget. We assume our elections to either have the candidate interval or the voter interval property, and we require the property to hold also after the bribery. While structured elections usually make manipulative attacks significantly easier, our work also shows examples of the opposite behavior. We conclude by presenting preliminary insights regarding the destructive variant of our problem.
title Bribery Can Get Harder in Structured Multiwinner Approval Election
topic Computer Science and Game Theory
F.2.2
url https://arxiv.org/abs/2209.00368