arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2510.19620cs.GTcs.CC
收藏

多胜票选中最小可实现配额的研究

On Minimal Achievable Quotas in Multiwinner Voting

Technical University of Munich(慕尼黑工业大学)

Patrick Becker, Fabian Frank

AI总结:

本文研究了多胜票选中实例依赖的最小配额问题,证明了投票规则与最优配额间的加性差距,并提出了一种整数线性规划方法来计算满足α-JR的委员会。

摘要:

在基于批准的多胜票选中,已确立了正当代表(JR)和扩展正当代表(EJR)等比例性公理。这两种公理总是可满足的,但它们依赖于固定的配额(通常为哈雷或德罗普配额),其中德罗普配额是保证在所有实例中存在性的最小配额。基于此,我们超越了固定配额范式,研究实例依赖的比例性概念。更具体地说,我们通过参数α最小化JR和EJR的配额要求。我们证明,所有常见的投票规则可以与最优值之间存在加性差距,为k²/(k+1)²。此外,我们研究了我们实例依赖的配额的计算方面,并证明确定给定批准配置的最优α值以允许某些委员会满足α-JR是NP完全的。为了解决这个问题,我们引入了一个整数线性规划(ILP)公式来计算满足α-JR的委员会,并在选民区间(VI)和候选区间(CI)领域提供了积极的计算结果。

英文摘要:

Justified representation (JR) and extended justified representation (EJR) are well-established proportionality axioms in approval-based multiwinner voting. Both axioms are always satisfiable, but they rely on a fixed quota (typically Hare or Droop), with the Droop quota being the smallest one that guarantees existence across all instances. With this in mind, we take a step beyond the fixed-quota paradigm by studying instance-dependent proportionality notions. More specifically, we minimize the quota requirements for JR and EJR using the parameter $α$. We demonstrate that all commonly studied voting rules can have an additive gap to the optimum of $\frac{k^2}{(k+1)^2}$. Moreover, we examine the computational aspects of our instance-dependent quota and prove that determining the optimal value of $α$ for a given approval profile that allows some committee to satisfy $α$-JR is NP-complete. To address this, we introduce an integer linear programming (ILP) formulation for computing committees that satisfy $α$-JR, and we provide positive computational results in the voter interval (VI) and candidate interval (CI) domains.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑