条件Minisum赞成投票规则的可处理性全景研究
On the Tractability Landscape of the Conditional Minisum Approval Voting Rule
AI总结：
本文研究了条件Minisum赞成投票规则的计算复杂度，证明暴力算法难以超越，并提出两种紧的实用限制使问题可处理，为条件赞成投票的实际应用提供了理论依据。
摘要：
本文研究了涉及多个相互依赖问题的选举的条件赞成框架，特别关注条件Minisum赞成投票规则。我们首先对该规则的计算复杂度进行了详细分析，证明在常见的计算复杂度假设和各种自然输入限制下，没有任何方法能显著优于暴力算法。为此，我们提出了两种实用的限制（文献中首次提出），使该问题在计算上变得可处理，并证明这些限制本质上是紧的。总体而言，本文清晰描绘了该问题的可处理性全景，有助于全面理解条件选票引入的复杂性，并表明条件赞成投票可在特定条件下实际应用。
英文摘要：
This work examines the Conditional Approval Framework for elections involving multiple interdependent issues, specifically focusing on the Conditional Minisum Approval Voting Rule. We first conduct a detailed analysis of the computational complexity of this rule, demonstrating that no approach can significantly outperform the brute-force algorithm under common computational complexity assumptions and various natural input restrictions. In response, we propose two practical restrictions (the first in the literature) that make the problem computationally tractable and show that these restrictions are essentially tight. Overall, this work provides a clear picture of the tractability landscape of the problem, contributing to a comprehensive understanding of the complications introduced by conditional ballots and indicating that conditional approval voting can be applied in practice, albeit under specific conditions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
