控制一个群体有多难？
How Hard Is It to Control A Group?
摘要：
我们考虑群体识别模型，其中关于谁在给定的社会中是合格的个人意见的聚合决定了一组社会合格的人。在这种情况下，我们研究的程度，社会资格可以改变时，社会扩大，缩小，或分割自己。我们提供的答案是相对于相应的控制问题的计算复杂性，并完全涵盖了一类的同意聚集规则引入的Samet和Schmeidler（2003），以及程序规则的群体识别。我们得到多项式时间的可解性结果和NP-硬度的结果。此外，我们还从参数化复杂性的角度研究了这些问题，并得到了一些固定参数的易处理性结果。
英文摘要：
We consider group identification models in which the aggregation of individual opinions concerning who is qualified in a given society determines the set of socially qualified persons. In this setting, we study the extent to which social qualification can be changed when societies expand, shrink, or partition themselves. The answers we provide are with respect to the computational complexity of the corresponding control problems and fully cover the class of consent aggregation rules introduced by Samet & Schmeidler (2003) as well as procedural rules for group identification. We obtain both polynomial-time solvability results and NP-hardness results. In addition, we also study these problems from the parameterized complexity perspective, and obtain some fixed-parameter tractability results.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
