具有候选人属性约束的委员会选举
Committee Elections with Candidate Attribute Constraints
AI总结:
本文研究带属性命题逻辑约束的委员会选举,给出经典复杂性二分结果,并分析不同参数下的参数化复杂性。
摘要:
在委员会选举的许多现实应用中,候选人与某些属性相关联,并且选出的委员会需要满足对候选人属性施加的若干约束。例如,在服装搭配时,人们通常认为,打领带时最好穿衬衫,而穿西装时最好穿皮鞋。在这里,服装被分为上装、下装、鞋子等类别;上装具有领带和衬衫属性,下装具有西装属性,鞋子具有皮鞋属性,并提出了“领带蕴含衬衫”和“西装蕴含皮鞋”两个约束。我们从计算复杂性的角度研究委员会选举的这一变体。给定一组候选人,每名候选人具有若干属性和一个收益,并给定一组以属性的命题逻辑表达式表示的约束,任务是计算出一个由 k 名候选人组成的集合,使其属性满足所有约束,并且总收益达到给定界限。我们在约束长度不受限制的情况下获得了关于经典复杂性的二分结论:如果满足以下两个条件,该问题可在多项式时间内求解:1)每名候选人只有一个属性;2)每个属性在约束中至多出现一次。若这两个条件中的任意一个被违反,问题就变为 NP-hard。此外,我们考察了其参数化复杂性。以约束数量、委员会规模或总收益界限为参数的参数化会导致 para-NP-hardness 或 W[1]-hardness,而以属性数量或候选人数量为参数时,该问题被证明是固定参数可处理的。
英文摘要:
In many real-world applications of committee elections, the candidates are associated with certain attributes and the chosen committee is required to satisfy some constraints posed on the candidate attributes. For instance, when dress collocation, it is generally acknowledged that when wearing a tie, you'd better wear a shirt, and wearing a suit, you'd better wear leather shoes. Here, dresses are categorized by upper garment, lower garment, shoes et.al, and upper garment is with the attribute tie and shirt, lower garment is with the attribute suit, and shoes is with the attribute leather. And two constraints "tie infers shirt" and "suit infers leather shoes" are proposed. We study this variant of committee elections from the computational complexity viewpoint. Given a set of candidates, each with some attributes and a profit, and a set of constraints, given as propositional logical expressions of the attributes, the task is to compute a set of k candidates, whose attributes satisfy all constraints and whose total profit achieves a given bound. We achieve a dichotomy concerning classical complexity with no length limit on constraints: the problem is polynomial-time solvable, if the following two conditions are fulfilled: 1) each candidate has only one attribute and 2) each attribute occurs at most once in the constraints. It becomes NP-hard if one of the two conditions is violated. Moreover, we examine its parameterized complexity. The parameterization with the number of constraints, the size of the committee, or the total profit bound as parameter leads to para-NP-hardness or W[1]-hardness, while with the number of attributes or the number of candidates as parameter, the problem turns out to be fixed-parameter tractable.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。