TY - GEN
T1 - Combinatorial voter control in elections
AU - Chen, Jiehua
AU - Faliszewski, Piotr
AU - Niedermeier, Rolf
AU - Talmon, Nimrod
N1 - Funding Information: This work has been partly supported by COST Action IC1205 on Computational Social Choice.
PY - 2014/1/1
Y1 - 2014/1/1
N2 - Voter control problems model situations such as an external agent trying to affect the result of an election by adding voters, for example by convincing some voters to vote who would otherwise not attend the election. Traditionally, voters are added one at a time, with the goal of making a distinguished alternative win by adding a minimum number of voters. In this paper, we initiate the study of combinatorial variants of control by adding voters: In our setting, when we choose to add a voter v, we also have to add a whole bundle κ(v) of voters associated with v. We study the computational complexity of this problem for two of the most basic voting rules, namely the Plurality rule and the Condorcet rule.
AB - Voter control problems model situations such as an external agent trying to affect the result of an election by adding voters, for example by convincing some voters to vote who would otherwise not attend the election. Traditionally, voters are added one at a time, with the goal of making a distinguished alternative win by adding a minimum number of voters. In this paper, we initiate the study of combinatorial variants of control by adding voters: In our setting, when we choose to add a voter v, we also have to add a whole bundle κ(v) of voters associated with v. We study the computational complexity of this problem for two of the most basic voting rules, namely the Plurality rule and the Condorcet rule.
UR - http://www.scopus.com/inward/record.url?scp=84906249171&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-662-44465-8_14
DO - https://doi.org/10.1007/978-3-662-44465-8_14
M3 - Conference contribution
SN - 9783662444641
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 153
EP - 164
BT - Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings
PB - Springer Verlag
T2 - 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014
Y2 - 25 August 2014 through 29 August 2014
ER -