arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2510.14752cs.GTcs.DSmath.OC
收藏

在线比例分配

Online Proportional Apportionment

Max Planck Institut für Informatik(马克斯·普朗克 informatics 研究所);Department of Industrial Engineering, Universidad de Chile(智利大学工业工程系);Centro de Modelamiento Matemático (CNRS IRL2807), Universidad de Chile(智利大学数学建模中心);Department of Computer Science, RWTH Aachen University(亚琛工业大学计算机系)

Javier Cembrano, Jose Correa, Svenja M. Griesbach, Victor Verdugo

AI总结:

本文提出在线比例分配框架,研究无未来信息时席位分配,证明确定性方法最坏偏差下界为线性且贪心最优,并构造随机化方法实现全局配额与期望比例份额。

摘要:

传统上,立法机构席位的分配问题被视为一次性过程,不考虑动态因素。虽然这种方法在某些情境下是合理的,但在许多其他情境中,动态方面发挥着重要作用。我们开创了在线设置下分配问题的研究。具体而言,我们引入了一个对未来信息一无所知的比例分配框架。在该模型中,时间是离散的,有$n$个政党在每个时间步获得一定比例的选票。在线算法需要在每个时刻不可撤销地分配规定数量的席位,确保每个政党获得其分数份额向上或向下取整后的席位,并且每个政党累计分配的席位数量保持接近其截至该时刻的累计份额。我们研究了确定性和随机化的在线分配方法。对于确定性方法,我们构造了一组对抗性实例,得出了最坏情况下政党分配席位与其累计份额之间偏差的下界,该下界与$n$成线性关系。我们证明了这个下界是最优的,并且一个自然的贪心方法可以达到该下界。因此,存在一种方法保证每个政党在任何步骤之前的累计分配席位数量等于其累计份额向上或向下取整(全局配额),当且仅当$n\leq 3$。然后,我们转向随机化分配,并表明对于$n\leq 3$,我们可以随机化满足全局配额的方法,并额外保证每个政党在每一步期望获得其比例份额。我们的证明是构造性的:任何满足这些性质的方法都可以从递归构建的网络上的流中获得。我们展示了我们的结果在在线依赖舍入过程中的近似解中的适用性。

英文摘要:

Traditionally, the problem of apportioning the seats of a legislative body has been viewed as a one-shot process with no dynamic considerations. While this approach is reasonable for some settings, dynamic aspects play an important role in many others. We initiate the study of apportionment problems in an online setting. Specifically, we introduce a framework for proportional apportionment with no information about the future. In this model, time is discrete and there are $n$ parties that receive a certain share of the votes at each time step. An online algorithm needs to irrevocably assign a prescribed number of seats at each time, ensuring that each party receives its fractional share rounded up or down, and that the cumulative number of seats allocated to each party remains close to its cumulative share up to that time. We study deterministic and randomized online apportionment methods. For deterministic methods, we construct a family of adversarial instances that yield a lower bound, linear in $n$, on the worst-case deviation between the seats allocated to a party and its cumulative share. We show that this bound is best possible and is matched by a natural greedy method. As a consequence, a method guaranteeing that the cumulative number of seats assigned to each party up to any step equals its cumulative share rounded up or down (global quota) exists if and only if $n\leq 3$. Then, we turn to randomized allocations and show that, for $n\leq 3$, we can randomize over methods satisfying global quota with the additional guarantee that each party receives, in expectation, its proportional share in every step. Our proof is constructive: Any method satisfying these properties can be obtained from a flow on a recursively constructed network. We showcase the applicability of our results to obtain approximate solutions in the context of online dependent rounding procedures.

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

↑