IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2604.13597.html

Daycare Matching with Siblings: Social Implementation and Welfare Evaluation

Author

Listed:
  • Kan Kuno
  • Daisuke Moriwaki
  • Yoshihiro Takenami

Abstract

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.

Suggested Citation

  • Kan Kuno & Daisuke Moriwaki & Yoshihiro Takenami, 2026. "Daycare Matching with Siblings: Social Implementation and Welfare Evaluation," Papers 2604.13597, arXiv.org, revised Apr 2026.
  • Handle: RePEc:arx:papers:2604.13597
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2604.13597
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2604.13597. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.