arXiv subjects

Yoshihiro Takenami

Publications and source records attributed to Yoshihiro Takenami.

3 recordsLinked to original sources

arXiv2026

Daycare Matching with Siblings: Social Implementation and Welfare Evaluation

In centralized assignment problems, agents may have preferences over joint rather than individual assignments, such as couples in residency matching or siblings in school choice and daycare. Standard preference estimation methods typically ignore such complementarities. This paper develops an empirical framework that explicitly incorporates them. Using data from daycare assignment in a municipality in Japan, we estimate a model in which families incur both additional commuting distance and a fixed non-distance disutility when siblings are assigned to different facilities. We find that split assignment generates a large disutility, equivalent to more than twice the average commuting distance. We then simulate counterfactual assignment policies that vary the strength of sibling priority and evaluate welfare. The sibling priority reform that we designed and that was implemented in 2024 increases welfare by 6.4% while reducing inequality in assignment rates across sibling groups; models that ignore sibling complementarities substantially understate these gains. At the same time, we uncover a clear efficiency-equity tradeoff: along the frontier, increasing mean welfare by 100 meters is associated with an increase in inequality of about 1.7 percentage points, and the welfare-maximizing policy reverses much of the reform's reduction in inequality, largely through the displacement of households without siblings.

econ.GN↗

arXiv2024

Stable Matchings in Practice: A Constraint Programming Approach

We study a practical two-sided matching problem of allocating children to daycare centers, which has significant social implications. We are cooperating with several municipalities in Japan and our goal is to devise a reliable and trustworthy clearing algorithm to deal with the problem. In this paper, we describe the design of our new algorithm that minimizes the number of unmatched children while ensuring stability. We evaluate our algorithm using real-life data sets, and experimental results demonstrate that our algorithm surpasses the commercial software that currently dominates the market in terms of both the number of matched children and the number of blocking coalitions (measuring stability). Our findings have been reported to local governments, and some are considering adopting our proposed algorithm in the near future, instead of the existing solution. Moreover, our model and algorithm have broader applicability to other important matching markets, such as hospital-doctor matching with couples and school choice with siblings.

cs.GT↗

arXiv2022

Daycare Matching in Japan: Transfers and Siblings

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.

cs.GT↗