Please use this identifier to cite or link to this item:
Title: Protecting elections by recounting ballots
Authors: Elkind, Edith
Gan, Jiarui
Obraztsova, Svetlana
Rabinovich, Zinovi
Voudouris, Alexandros A.
Keywords: Engineering::Computer science and engineering
Issue Date: 2020
Source: Elkind, E., Gan, J., Obraztsova, S., Rabinovich, Z. & Voudouris, A. A. (2020). Protecting elections by recounting ballots. Artificial Intelligence, 290, 103401-.
Project: AcRF-T1-RG23/18
SUG M4081985
Journal: Artificial Intelligence
Abstract: Complexity of voting manipulation is a prominent topic in computational social choice. In this work, we consider a two-stage voting manipulation scenario. First, a malicious party (an attacker) attempts to manipulate the election outcome in favor of a preferred candidate by changing the vote counts in some of the voting districts. Afterwards, another party (a defender), which cares about the voters' wishes, demands a recount in a subset of the manipulated districts, restoring their vote counts to their original values. We investigate the resulting Stackelberg game for the case where votes are aggregated using two variants of the Plurality rule, and obtain an almost complete picture of the complexity landscape, both from the attacker's and from the defender's perspective.
ISSN: 0004-3702
DOI: 10.1016/j.artint.2020.103401
Rights: © 2020 Elsevier B.V. All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Journal Articles

Page view(s)

Updated on May 25, 2022

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.