We design and implement an iterative, program-proposing deferred acceptance mechanism with ties (IDAT) and apply it to childcare assignment in two German cities. The mechanism can accommodate complementarities in providers' preferences, is fast to terminate even in larger cities, is difficult to manipulate in practice, and produces stable allocations. It can be further sped up by introducing two new features. First, allowing for an arbitrary share of facilities who participate in a centralized manner by submitting a rank- order-list over applicants. Second, by breaking ties in applicants' rankorder-lists on a first-come-first-serve basis, which sets incentives for programs to propose faster.

Reischmann, Tobias, Thilo Klein und Sven Giegerich (2021), An Iterative Deferred Acceptance Mechanism for Decentralized, Fast and Fair Childcare Assignment, ZEW Discussion Paper No. 21-095, Mannheim. Download

Autoren

Reischmann, Tobias
Klein, Thilo
Giegerich, Sven

Schlagworte

Childcare assignment, deferred acceptance algorithm