加权选举控制
Weighted Electoral Control
摘要：
虽然操纵和贿赂已被广泛研究加权投票下，有几乎没有工作做加权投票下的选举控制。这是不幸的，因为加权投票出现在许多重要的自然环境中。在本文中，我们研究了通过增加和删除选民来控制加权选举结果的复杂性。我们得到多项式时间算法，NP-完全性结果，并为许多NP-完全的情况下，近似算法。特别是，对于评分规则，我们完全描述了加权选民控制的复杂性。我们的工作表明，对于相当多的重要情况下，多项式时间的精确算法或多项式时间的近似算法存在。
英文摘要：
Although manipulation and bribery have been extensively studied under weighted voting, there has been almost no work done on election control under weighted voting. This is unfortunate, since weighted voting appears in many important natural settings. In this paper, we study the complexity of controlling the outcome of weighted elections through adding and deleting voters. We obtain polynomial-time algorithms, NP-completeness results, and for many NP-complete cases, approximation algorithms. In particular, for scoring rules we completely characterize the complexity of weighted voter control. Our work shows that for quite a few important cases, either polynomial-time exact algorithms or polynomial-time approximation algorithms exist.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
