Boston分配算法的渐近福利性能
Asymptotic welfare performance of Boston assignment algorithms
摘要:
我们对住房分配问题的三个关键算法(串行独裁和波士顿算法的朴素和自适应变体)进行了详细的分析,假设代理偏好是从物品的线性顺序中均匀选择的。我们将限制分布(相对于一些常见的效用函数)计算为功利主义福利和秩序偏差的$n\to \infty$。要做到这一点,我们计算限制分布的结果为任意代理的初始相对位置在抢七顺序是$θ\in[0,1]$,作为一个函数的$θ$。波士顿算法的结果都是新的,我们希望这些基本结果的随机过程这些算法将在未来有更广泛的适用性。总的来说,我们的研究结果表明,在功利福利性能的三种算法的差异是相当小的,但仍然很重要。然而,顺序偏差的差异要大得多。此外,在功利主义福利和秩序偏见方面,《天真的波士顿》击败了《适应的波士顿》,后者击败了《连续独裁》。
英文摘要:
We make a detailed analysis of three key algorithms (Serial Dictatorship and the naive and adaptive variants of the Boston algorithm) for the housing allocation problem, under the assumption that agent preferences are chosen iid uniformly from linear orders on the items. We compute limiting distributions (with respect to some common utility functions) as $n\to \infty$ of both the utilitarian welfare and the order bias. To do this, we compute limiting distributions of the outcomes for an arbitrary agent whose initial relative position in the tiebreak order is $θ\in[0,1]$, as a function of $θ$. The results for the Boston algorithms are all new, and we expect that these fundamental results on the stochastic processes underlying these algorithms will have wider applicability in future. Overall our results show that the differences in utilitarian welfare performance of the three algorithms are fairly small but still important. However, the differences in order bias are much greater. Also, Naive Boston beats Adaptive Boston, which beats Serial Dictatorship, on both utilitarian welfare and order bias.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。