An iterative deferred acceptance mechanism for decentralized, fast and fair childcare assignment

Tobias Reischmann, Thilo Klein and Sven Giegerich

No 21-095, ZEW Discussion Papers from ZEW - Leibniz Centre for European Economic Research

Abstract: 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' rank-order-lists on a first-come-first-serve basis, which sets incentives for programs to propose faster.

Keywords: Childcare assignment; deferred acceptance algorithm (search for similar items in EconPapers)
JEL-codes: C78 D02 D47 D82 I24 (search for similar items in EconPapers)
Date: 2021
New Economics Papers: this item is included in nep-des
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://www.econstor.eu/bitstream/10419/247704/1/1780550707.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:zbw:zewdip:21095

Access Statistics for this paper

More papers in ZEW Discussion Papers from ZEW - Leibniz Centre for European Economic Research Contact information at EDIRC.
Bibliographic data for series maintained by ZBW - Leibniz Information Centre for Economics ().