论文标题
委员会选举中相称程度的复杂性
The Complexity of Proportionality Degree in Committee Elections
论文作者
论文摘要
在过去的几年中，研究人员付出了巨大的努力来理解委员会选举中比例代表的概念。特别是，最近他们提出了相称程度的概念。如果给定的委员会提供了特定的委员会，我们研究了具有给定比例程度的计算委员会的复杂性和测试。这样，我们补充了最近的研究，这些研究主要集中在（扩展）合理的表示的概念上。我们还研究了是否存在特定大小的凝聚组和计数此类组的测试问题。
Over the last few years, researchers have put significant effort into understanding of the notion of proportional representation in committee election. In particular, recently they have proposed the notion of proportionality degree. We study the complexity of computing committees with a given proportionality degree and of testing if a given committee provides a particular one. This way, we complement recent studies that mostly focused on the notion of (extended) justified representation. We also study the problems of testing if a cohesive group of a given size exists and of counting such groups.
