Protecting elections by recounting ballots

Autor: Edith Elkind, Zinovi Rabinovich, Alexandros A. Voudouris, Svetlana Obraztsova, Jiarui Gan
Přispěvatelé: School of Computer Science and Engineering
Jazyk: angličtina
Rok vydání: 2020
Předmět:
FOS: Computer and information sciences
Linguistics and Language
Computer science
media_common.quotation_subject
ComputingMilieux_LEGALASPECTSOFCOMPUTING
02 engineering and technology
Outcome (game theory)
Language and Linguistics
Microeconomics
Artificial Intelligence
Computer Science - Computer Science and Game Theory
020204 information systems
Voting
0202 electrical engineering
electronic engineering
information engineering

Stackelberg competition
Voting Manipulation
Computer Science - Multiagent Systems
Election Recounting
media_common
Perspective (graphical)
Plurality rule
16. Peace & justice
Work (electrical)
Computational social choice
Computer science and engineering [Engineering]
020201 artificial intelligence & image processing
Computer Science and Game Theory (cs.GT)
Multiagent Systems (cs.MA)
Zdroj: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence
Scopus-Elsevier
IJCAI
Artificial Intelligence
Popis: 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. Ministry of Education (MOE) Nanyang Technological University This work has been supported by the ERC Starting Grant 639945 (ACCORD), the EPSRC International Doctoral Scholars Grant EP/N509711/1, MOE AcRF-T1-RG23/18 grant, and the NTU SUG M4081985 grant.
Databáze: OpenAIRE