一种实用的最坏情况下有效的除数法算法
A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment
摘要:
按比例分配是根据政党的相对选票份额分配席位的问题。除数方法是事实标准解决方案,在许多国家使用。在最近的文献中,有两种实现除数方法的算法:一种是Cheng和Eppstein(ISAAC,2014),具有最坏情况下的最佳运行时间,但很复杂,而另一种(Pukelsheim,2014)在实践中相对简单和快速,但不提供最坏情况的保证。我们证明了前一种算法在实践中比其他算法慢得多,并提出了一种新的算法,避免了两者的缺点。我们调查的三个竞争者的运行时的行为,以确定哪一个是最有用的实践。
英文摘要:
Proportional apportionment is the problem of assigning seats to parties according to their relative share of votes. Divisor methods are the de-facto standard solution, used in many countries. In recent literature, there are two algorithms that implement divisor methods: one by Cheng and Eppstein (ISAAC, 2014) has worst-case optimal running time but is complex, while the other (Pukelsheim, 2014) is relatively simple and fast in practice but does not offer worst-case guarantees. We demonstrate that the former algorithm is much slower than the other in practice and propose a novel algorithm that avoids the shortcomings of both. We investigate the running-time behavior of the three contenders in order to determine which is most useful in practice.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。