TY - GEN

T1 - Privacy in elections

T2 - 20th International Symposium on Fundamentals of Computation Theory, FCT 2015

AU - Talmon, Nimrod

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2015.

PY - 2015/1/1

Y1 - 2015/1/1

N2 - We study the (parameterized) complexity of a combinatorial problem, motivated by the desire to publish elections-related data, while preserving the privacy of the voters (humans or agents). In this problem, introduced and defined here, we are given an election, a voting rule, and a distance function over elections. The task is to find an election which is not too far away from the original election (with respect to the given distance function) while preserving the election winner (with respect to the given voting rule), and such that the resulting election is k-anonymized; an election is said to be k-anonymous if for each voter in it there are at least k − 1 other voters with the same preference order. We consider the problem of k-anonymizing elections for the Plurality rule and for the Condorcet rule, for the Discrete distance and for the Swap distance. We show that the parameterized complexity landscape of our problem is diverse, with cases ranging from being polynomial-time solvable to Para-NP-hard.

AB - We study the (parameterized) complexity of a combinatorial problem, motivated by the desire to publish elections-related data, while preserving the privacy of the voters (humans or agents). In this problem, introduced and defined here, we are given an election, a voting rule, and a distance function over elections. The task is to find an election which is not too far away from the original election (with respect to the given distance function) while preserving the election winner (with respect to the given voting rule), and such that the resulting election is k-anonymized; an election is said to be k-anonymous if for each voter in it there are at least k − 1 other voters with the same preference order. We consider the problem of k-anonymizing elections for the Plurality rule and for the Condorcet rule, for the Discrete distance and for the Swap distance. We show that the parameterized complexity landscape of our problem is diverse, with cases ranging from being polynomial-time solvable to Para-NP-hard.

UR - http://www.scopus.com/inward/record.url?scp=84943614770&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/978-3-319-22177-9_23

DO - https://doi.org/10.1007/978-3-319-22177-9_23

M3 - Conference contribution

SN - 9783319221762

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 299

EP - 310

BT - Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Proceedings

A2 - Walukiewicz, Igor

A2 - Kosowski, Adrian

PB - Springer Verlag

Y2 - 17 August 2015 through 19 August 2015

ER -