少数选民的选举：候选人控制可以很容易
Elections with Few Voters: Candidate Control Can Be Easy
摘要：
本文研究了少选民选举中候选人控制的计算复杂性，即把选举中候选人控制的参数化复杂性以选民人数为参数。我们考虑了添加和删除候选人的标准场景，其中一个问题是，通过添加或删除几个候选人，给定的候选人是否可以成为赢家（或者，在破坏性的情况下，可以被排除在获胜之外），以及一个组合场景，其中添加/删除一个候选人自动意味着添加或删除一整组候选人。考虑到几个基本的投票规则，我们的研究结果表明，候选人控制的参数化的复杂性，与选民的数量作为参数，是更多样的设置与许多选民。
英文摘要：
We study the computational complexity of candidate control in elections with few voters, that is, we consider the parameterized complexity of candidate control in elections with respect to the number of voters as a parameter. We consider both the standard scenario of adding and deleting candidates, where one asks whether a given candidate can become a winner (or, in the destructive case, can be precluded from winning) by adding or deleting few candidates, as well as a combinatorial scenario where adding/deleting a candidate automatically means adding or deleting a whole group of candidates. Considering several fundamental voting rules, our results show that the parameterized complexity of candidate control, with the number of voters as the parameter, is much more varied than in the setting with many voters.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
