基于固定除数方法的顺序分配
Sequential Apportionment from Stationary Divisor Methods
AI总结:
本文研究了基于固定除数方法的顺序分配,揭示了不同方法生成的序列之间的关系,并展示了如何将两党分配扩展到多党设置中。
摘要:
除数方法以满足住房单调性而闻名,这允许代表席位按顺序分配。我们关注由一个截断点c∈[0,1]定义的固定除数方法。对于具有整数值的选票,所得到的分配序列是周期性的。在关注两党分配的情况下,我们刻画了可能的序列集,并建立了这些序列的字典序与参数c之间的联系。然后我们展示如何系统地将所有党派对的序列扩展到n党设置中。进一步,我们确定了n党问题中所有c对应的不同序列数量。我们的方法提供了一个更精细的视角来看待规模偏差:而不是将大党视为仅仅获得更多席位,我们显示它们在分配序列中更早获得席位。特别值得注意的是,我们揭示了一个新的关系,即由最小除数(Adams)方法和最大除数(D'Hondt或Jefferson)方法生成的序列之间的关系。
英文摘要:
Divisor methods are well known to satisfy house monotonicity, which allows representative seats to be allocated sequentially. We focus on stationary divisor methods defined by a rounding cutpoint $c \in [0,1]$. For such methods with integer-valued votes, the resulting apportionment sequences are periodic. Restricting attention to two-party allocations, we characterize the set of possible sequences and establish a connection between the lexicographical ordering of these sequences and the parameter $c$. We then show how sequences for all pairs of parties can be systematically extended to the $n$-party setting. Further, we determine the number of distinct sequences in the $n$-party problem for all $c$. Our approach offers a refined perspective on size bias: rather than viewing large parties as simply receiving more seats, we show that they instead obtain their seats earlier in the apportionment sequence. Of particular interest is a new relationship we uncover between the sequences generated by the smallest divisor (Adams) and greatest divisor (D'Hondt or Jefferson) methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。