{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:31:10Z","timestamp":1762299070655},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,8]]},"abstract":"<jats:p>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\nto 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.<\/jats:p>","DOI":"10.24963\/ijcai.2019\/37","type":"proceedings-article","created":{"date-parts":[[2019,7,28]],"date-time":"2019-07-28T07:46:05Z","timestamp":1564299965000},"page":"259-265","source":"Crossref","is-referenced-by-count":4,"title":["Protecting Elections by Recounting Ballots"],"prefix":"10.24963","author":[{"given":"Edith","family":"Elkind","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Oxford"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiarui","family":"Gan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Oxford"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Svetlana","family":"Obraztsova","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Nanyang Technological University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zinovi","family":"Rabinovich","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Nanyang Technological University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandros A.","family":"Voudouris","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Oxford"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"number":"28","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-2019","name":"Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}","start":{"date-parts":[[2019,8,10]]},"theme":"Artificial Intelligence","location":"Macao, China","end":{"date-parts":[[2019,8,16]]}},"container-title":["Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2019,7,28]],"date-time":"2019-07-28T07:46:23Z","timestamp":1564299983000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2019\/37"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2019\/37","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}