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.
Bulteau, L., Chen, J., Faliszewski, P., Niedermeier, R., & Talmon, N. (2015). Combinatorial voter control in elections. Theoretical Computer Science, 589, 99–120. https://doi.org/10.1016/j.tcs.2015.04.023