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

两组之间的公平学校重新划分

Envy-Free School Redistricting Between Two Groups

Osaka University(大阪大学)

Daisuke Shibatani, Yutaro Yamaguchi

AI总结:

本文研究了公平分配理论在学校重新划分中的应用,针对两组情况提出1-relaxed envy-freeness概念,证明其在多项式时间内可找到满足条件的分配方案。

摘要:

我们研究了公平分配理论在学校重新划分中的应用。Procaccia, Robinson和Tucker-Foltz(SODA 2024)最近提出了一种数学模型,用于生成提供理论上保证公平性的重新划分计划。他们证明,通过添加O(g log g)个额外席位,可以找到近似比例分配,其中g是群体数量。相比之下,对于三个或更多群体,添加o(n)个额外席位通常不足以获得近似无怨恨分配,其中n是总学生数。在本文中,我们关注两组情况。我们引入了一个相关的无怨恨公平性的放松概念,称为1-relaxed envy-freeness,该概念限制每个学校容量违反不超过一个。我们证明总存在一个1-relaxed envy-free分配,该分配可以在多项式时间内找到。

英文摘要:

We study an application of fair division theory to school redistricting. Procaccia, Robinson, and Tucker-Foltz (SODA 2024) recently proposed a mathematical model to generate redistricting plans that provide theoretically guaranteed fairness among demographic groups of students. They showed that an almost proportional allocation can be found by adding $O(g \log g)$ extra seats in total, where $g$ is the number of groups. In contrast, for three or more groups, adding $o(n)$ extra seats is not sufficient to obtain an almost envy-free allocation in general, where $n$ is the total number of students. In this paper, we focus on the case of two groups. We introduce a relevant relaxation of envy-freeness, termed 1-relaxed envy-freeness, which limits the capacity violation not in total but at each school to at most one. We show that there always exists a 1-relaxed envy-free allocation, which can be found in polynomial time.

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

↑