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

在线两阶段稳定匹配

Online 2-stage Stable Matching

Sorbonne Université(索邦大学);CNRS(法国国家科学研究中心);Institut Universitaire de France(法国大学研究院);Univ. Grenoble Alpes(格勒诺布尔阿尔卑斯大学)

Evripidis Bampis, Bruno Escoffier, Paul Youssef

AI总结:

针对学生大学分配的在线两阶段稳定匹配问题,提出无需预知退出学生即可最小化匹配修改次数的最优在线算法,并推广至其他输入变动场景,同时证明三阶段及以上不存在有竞争力的在线算法。

摘要:

我们聚焦于一个在线两阶段问题,其研究动机源于如下场景:考虑一个需将学生分配至大学的系统。第一阶段有部分学生提交申请,此时必须计算出第一份(稳定)匹配$M_1$。但部分学生可能决定退出系统(改变计划、前往国外大学,或选择系统外的其他院校)。随后在第二阶段(即这些学生退出后),我们需要计算第二份(最终)稳定匹配$M_2$。由于更改分配结果是不理想的,研究目标是最小化两份稳定匹配$M_1$与$M_2$之间的解约/修改次数。那么我们应当如何选择$M_1$和$M_2$?我们证明存在一种最优在线算法可以解决该问题。具体而言,借助一种支配性性质,我们表明无需知晓哪些学生将退出系统,就能最优地计算出$M_1$。我们还将该结果推广至输入存在其他可能变动的情况(学生数量、开放招生名额)。我们还研究了更多阶段的情况,证明只要阶段数达到3个,所研究的问题就不存在具有竞争力的(在线)算法。

英文摘要:

We focus on an online 2-stage problem, motivated by the following situation: consider a system where students shall be assigned to universities. There is a first round where some students apply, and a first (stable) matching $M_1$ has to be computed. However, some students may decide to leave the system (change their plan, go to a foreign university, or to some institution not in the system). Then, in a second round (after these deletions), we shall compute a second (final) stable matching $M_2$. As it is undesirable to change assignments, the goal is to minimize the number of divorces/modifications between the two stable matchings $M_1$ and $M_2$. Then, how should we choose $M_1$ and $M_2$? We show that there is an {\it optimal online} algorithm to solve this problem. In particular, thanks to a dominance property, we show that we can optimally compute $M_1$ without knowing the students that will leave the system. We generalize the result to some other possible modifications in the input (students, open positions). We also tackle the case of more stages, showing that no competitive (online) algorithm can be achieved for the considered problem as soon as there are 3 stages.

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

↑