表决系统中硬控制问题的可编程求解
Solving Hard Control Problems in Voting Systems via Integer Programming
摘要：
投票问题是社会选择领域的核心问题。在这篇文章中，我们调查了各种投票系统和选举控制类型。我们提出了整数线性规划（ILP）的配方范围广泛的NP-难控制问题。我们的ILP公式是灵活的，因为它们可以与任意数量的候选人和选民一起工作。使用现成的求解器Cplex，我们表明，我们的方法可以有效地操纵大量的选民和候选人的选举。
英文摘要：
Voting problems are central in the area of social choice. In this article, we investigate various voting systems and types of control of elections. We present integer linear programming (ILP) formulations for a wide range of NP-hard control problems. Our ILP formulations are flexible in the sense that they can work with an arbitrary number of candidates and voters. Using the off-the-shelf solver Cplex, we show that our approaches can manipulate elections with a large number of voters and candidates efficiently.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
