Related papers: Daycare Matching in Japan: Transfers and Siblings
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…
We study a practical centralized matching problem which assigns children to daycare centers. The collective preferences of siblings from the same family introduce complementarities, which can lead to the absence of stable matchings, as…
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…
In centralized assignment mechanisms, unassigned participants are often placed on waitlists to improve their chances in future rounds. However, I demonstrate that this practice may bring unintended welfare consequences on the participants,…
We investigate the allocation of children to childcare facilities and propose solutions to overcome limitations in the current allocation mechanism. We introduce a natural preference domain and a priority structure that address these…
Centralized assignment markets have historically relied on Deferred-Acceptance (DA) algorithms, which do not incorporate multiple objectives into the assignment. In this work, we propose an optimization-based many-to-one assignment…
Several countries successfully use centralized matching schemes for school or higher education assignment, or for entry-level labour markets. In this paper we explore the computational aspects of a possible similar scheme for assigning…
We study the problem of an organization that matches agents to objects where agents have preference rankings over objects and the organization uses algorithms to construct a ranking over objects on behalf of each agent. Our new framework…
In response to the declining population and aging infrastructure in Japan, local governments are implementing compact city policies such as the location normalization plan. To optimize the reorganization of urban public infrastructure, it…
Fragmentation of matching markets is a ubiquitous problem across countries and across applications. In order to study the implications of fragmentation and possibilities for integration, we first document and discuss a variety of…
The logistics industry in Japan is facing a severe shortage of labor. Therefore, there is an increasing need for joint transportation allowing large amounts of cargo to be transported using fewer trucks. In recent years, the use of…
Matching algorithms have demonstrated great success in several practical applications, but they often require centralized coordination and plentiful information. In many modern online marketplaces, agents must independently seek out and…
Problem, research strategy, and findings: Urban parks offer residents significant physiological and mental health benefits, improving their quality of life. However, traditional park planning often treats parks as static spatial resources,…
An applied problem facing all areas of data science is harmonizing data sources. Joining data from multiple origins with unmapped and only partially overlapping features is a prerequisite to developing and testing robust, generalizable…
This chapter surveys the application of matching theory to school choice, motivated by the shift from neighborhood assignment systems to choice-based models. Since educational choice is not mediated by price, the design of allocation…
The aim of this research is twofold: Firstly, to model and solve a complex nurse scheduling problem with an integer programming formulation and evolutionary algorithms. Secondly, to detail a novel statistical method of comparing and hence…
More than 80 civic tech communities in Japan are developing information technology (IT) systems to solve their regional issues. Collaboration among such communities across different regions assists in solving their problems because some…
Two-sided matching markets, environments in which two disjoint groups of agents seek to partner with one another, arise in several contexts. In static, centralized markets where agents know their preferences, standard algorithms can yield a…
The matching literature often recommends market centralization under the assumption that agents know their own preferences and that their preferences are fixed. We find counterevidence to this assumption in a quasi-experiment. In Germany's…
Caseworkers in foster care systems match waiting children to adoptive homes. We use dynamic matching market design to characterize a class of mechanisms that incentivize expedient matches that homes can accept or decline. We design…