论文标题
关于使用单调，可分离的位置多翼投票规则寻找多元化和代表委员会的复杂性
On the Complexity of Finding a Diverse and Representative Committee using a Monotone, Separable Positional Multiwinner Voting Rule
论文作者
论文摘要
多翼纳选举中的公平性是计算社会选择中越来越多的研究范围的公平性，主要涉及使用约束来确保公平性。最近的工作提出了一个模型，以找到一个不同的\ emph {and}代表委员会，并研究了该模型的计算方面。但是，这项工作为候选人和选民如何分组的主要假设提供了复杂性结果。在这里，我们缩小了这一差距，并对使用单调，可分开的位置多翼票的投票规则进行了各种和代表性委员会的复杂性，并在p $ \ neq $ np的假设上有条件\ emph {holy}。
Fairness in multiwinner elections, a growing line of research in computational social choice, primarily concerns the use of constraints to ensure fairness. Recent work proposed a model to find a diverse \emph{and} representative committee and studied the model's computational aspects. However, the work gave complexity results under major assumptions on how the candidates and the voters are grouped. Here, we close this gap and classify the complexity of finding a diverse and representative committee using a monotone, separable positional multiwinner voting rule, conditioned \emph{only} on the assumption that P $\neq$ NP.
