arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2102.12305cs.GT
收藏

Phragmén的投票方法与证明表示

Phragmén's Voting Methods and Justified Representation

Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner

摘要:

在19世纪后期,瑞典数学家拉尔斯·爱德华·弗拉格门(Lars Edvard Phragmén)提出了一种基于批准选票的负载平衡方法来选择委员会。我们认为三个委员会的投票规则产生这种方法:两个优化变量-一个最大限度地减少最大负载和一个最小化负载的方差-和一个顺序的变体。我们研究Phragmén的方法从公理的角度来看,专注于捕获比例代表性的属性。我们证明了顺序变量满足比例合理表示,这是一个罕见的属性委员会单调方法。此外,我们表明,优化变量满足完美的表示。我们还分析了Phragmén方法的计算复杂性,并提供了基于混合整数规划的算法来计算它们。

英文摘要:

In the late 19th century, Swedish mathematician Lars Edvard Phragmén proposed a load-balancing approach for selecting committees based on approval ballots. We consider three committee voting rules resulting from this approach: two optimization variants - one minimizing the maximal load and one minimizing the variance of loads - and a sequential variant. We study Phragmén's methods from an axiomatic point of view, focusing on properties capturing proportional representation. We show that the sequential variant satisfies proportional justified representation, which is a rare property for committee monotonic methods. Moreover, we show that the optimization variants satisfy perfect representation. We also analyze the computational complexity of Phragmén's methods and provide mixed-integer programming based algorithms for computing them.

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

↑