@inproceedings{09c20c51fbec44a091edce447cb4a8fc,
title = "Computational Complexity Characterization of Protecting Elections from Bribery",
abstract = "The bribery problem in election has received considerable attention in the literature, upon which various algorithmic and complexity results have been obtained. It is thus natural to ask whether we can protect an election from potential bribery. We assume that the protector can protect a voter with some cost (e.g., by isolating the voter from potential bribers). A protected voter cannot be bribed. Under this setting, we consider the following bi-level decision problem: Is it possible for the protector to protect a proper subset of voters such that no briber with a fixed budget on bribery can alter the election result? The goal of this paper is to give a full picture on the complexity of protection problems. We give an extensive study on the protection problem and provide algorithmic and complexity results. Comparing our results with that on the bribery problems, we observe that the protection problem is in general significantly harder. Indeed, it becomes complete even for very restricted special cases, while most bribery problems lie in NP. However, it is not necessarily the case that the protection problem is always harder. Some of the protection problems can still be solved in polynomial time, while some of them remain as hard as the bribery problem under the same setting.",
keywords = "Complexity, Hardness, NP-hardness, Voting",
author = "Lin Chen and Ahmed Sunny and Lei Xu and Shouhuai Xu and Zhimin Gao and Yang Lu and Weidong Shi and Nolan Shah",
note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; null ; Conference date: 29-08-2020 Through 31-08-2020",
year = "2020",
doi = "10.1007/978-3-030-58150-3_7",
language = "English",
isbn = "9783030581497",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "85--97",
editor = "Donghyun Kim and R.N. Uma and Zhipeng Cai and Lee, {Dong Hoon}",
booktitle = "Computing and Combinatorics - 26th International Conference, COCOON 2020, Proceedings",
}