Conference item icon

Conference item

Protecting elections by recounting ballots

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 vo...

Expand abstract
Publication status:
Published
Peer review status:
Reviewed (other)

Actions


Access Document


Files:
Publisher copy:
10.24963/ijcai.2019/37

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Oxford college:
Balliol College
Role:
Author
Publisher:
Association for the Advancement of Artificial Intelligence Publisher's website
Journal:
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence
Pages:
259-265
Host title:
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence
Publication date:
2019-08-16
Acceptance date:
2019-05-10
DOI:
Source identifiers:
1052512
ISBN:
9780999241141
Pubs id:
pubs:1052512
UUID:
uuid:637e35e4-8683-4750-9715-3bce206715d3
Local pid:
pubs:1052512
Deposit date:
2019-09-09

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP