DeepAI AI Chat
Log In Sign Up

Daycare Matching in Japan: Transfers and Siblings

by   Zhaohong Sun, et al.

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.


page 1

page 2

page 3

page 4


On the (Parameterized) Complexity of Almost Stable Marriage

In the Stable Marriage problem. when the preference lists are complete, ...

How good are Popular Matchings?

In this paper, we consider the Hospital Residents problem (HR) and the H...

Population estimation for child care centers through linear regressions

This article arises as an alternative solution to the problem of estimat...

Improved Paths to Stability for the Stable Marriage Problem

The stable marriage problem requires one to find a marriage with no bloc...

On Fairness and Stability in Two-Sided Matchings

There are growing concerns that algorithms, which increasingly make or i...

Mathematical models for stable matching problems with ties and incomplete lists

We present new integer linear programming (ILP) models for NP-hard optim...

Minimal Envy Matchings in the Hospitals/Residents Problem with Lower Quotas

In the Hospitals/Residents problem, every hospital has an upper quota th...