论文标题
日本的日托匹配：转移和兄弟姐妹
Daycare Matching in Japan: Transfers and Siblings
论文作者
论文摘要
在本文中，我们研究了日本的日托匹配问题，并报告了一种新的集中算法的设计和实施，该算法将部署在东京大都会的一个市政当局中。有两个使这个市场不同于经典医院医院匹配的问题：i）一些孩子最初被招募，并且宁愿将其转移到其他日托中心； ii）一个家庭可能与两个或更多儿童有关，并被允许提交与日托中心组合的偏好。我们重新审视了一些经过充分研究的属性，包括个人合理性，非垃圾和稳定性，并将其推广到这种新环境。我们设计了一种基于整数编程（IP）的算法，该算法捕获了这些属性并在三个市政当局提供的五个现实生活数据集上进行实验。实验结果表明，i）我们的算法至少在匹配的儿童和阻止联盟的数量方面执行的算法以及当前使用的方法； ii）我们可以在所有情况下找到稳定的结果，尽管在理论上不能保证这种结果的存在。
In this paper, we study a daycare matching problem in Japan and report the design and implementation of a new centralized algorithm, which is going to be deployed in one municipality in the Tokyo metropolis. There are two features that make this market different from the classical hospital-doctor matching problem: i) some children are initially enrolled and prefer to be transferred to other daycare centers; ii) one family may be associated with two or more children and is allowed to submit preferences over combinations of daycare centers. We revisit some well-studied properties including individual rationality, non-wastefulness, as well as stability, and generalize them to this new setting. We design an algorithm based on integer programming (IP) that captures these properties and conduct experiments on five real-life data sets provided by three municipalities. Experimental results show that i) our algorithm performs at least as well as currently used methods in terms of numbers of matched children and blocking coalition; ii) we can find a stable outcome for all instances, although the existence of such an outcome is not guaranteed in theory.
