IDEAS home Printed from
   My bibliography  Save this paper

The Daycare Assignment Problem


  • John Kennes

    () (Department of Economics and Business, Aarhus University, Denmark)

  • Daniel Monte

    () (Department of Economics, Simon Fraser University, Canada)

  • Norovsambuu Tumennasan

    () (Department of Economics and Business, Aarhus University, Denmark)


In this paper we take the mechanism design approach to the problem of assigning children of different ages to daycares, motivated by the mechanism currently in place in Denmark. This problem is similar to the school choice problem, but has two distinguishing features. First, it is characterized by an overlapping generations structure. For example, children of different ages may be allocated to the same daycare, and the same child may be allocated to different daycares across time. Second, the daycares' priorities are history-dependent: a daycare gives priority to children currently enrolled in it, as is the case with the Danish system. We first study the concept of stability, and, to account for the dynamic nature of the problem, we propose a novel solution concept, which we call strong stability. With a suitable restriction on the priority orderings of schools, we show that strong stability and the weaker concept of static stability will coincide. We then extend the well known Gale-Shapley deferred acceptance algorithm for dynamic problems and show that it yields a matching that satisfies strong stability. It is not Pareto dominated by any other matching, and, if there is an efficient stable matching, it must be the Gale-Shapley one. However, contrary to static problems, it does not necessarily Pareto dominate all other strongly stable mechanisms. Most importantly, we show that the Gale-Shapley algorithm is not strategy-proof. In fact, one of our main results is a much stronger impossibility result: For the class of dynamic matching problems that we study, there are no algorithms that satisfy strategy-proofness and strong stability. Second, we show that the also well known Top Trading Cycles algorithm is neither Pareto efficient nor strategy-proof. We conclude by proposing a variation of the serial dictatorship, which is strategyproof and efficient.

Suggested Citation

  • John Kennes & Daniel Monte & Norovsambuu Tumennasan, 2011. "The Daycare Assignment Problem," Economics Working Papers 2011-05, Department of Economics and Business Economics, Aarhus University.
  • Handle: RePEc:aah:aarhec:2011-05

    Download full text from publisher

    File URL:
    Download Restriction: no


    Blog mentions

    As found by, the blog aggregator for Economics research:
    1. The daycare assignment problem
      by Economic Logician in Economic Logic on 2011-06-16 19:20:00


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. John Kennes Jr. & Daniel Monte Jr. & Norovsambuu Tumennasan Jr., 2014. "The Day Care Assignment: A Dynamic Matching Problem," American Economic Journal: Microeconomics, American Economic Association, vol. 6(4), pages 362-406, November.
    2. Monte, Daniel & Tumennasan, Norovsambuu, 2015. "Centralized allocation in multiple markets," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 74-85.
    3. Lawrence M. Ausubel & Thayer Morrill, 2014. "Sequential Kidney Exchange," American Economic Journal: Microeconomics, American Economic Association, vol. 6(3), pages 265-285, August.

    More about this item


    daycare assignment; market design; matching; overlapping generations; weak and strong stability; efficiency;

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D61 - Microeconomics - - Welfare Economics - - - Allocative Efficiency; Cost-Benefit Analysis
    • D78 - Microeconomics - - Analysis of Collective Decision-Making - - - Positive Analysis of Policy Formulation and Implementation
    • I20 - Health, Education, and Welfare - - Education - - - General

    NEP fields

    This paper has been announced in the following NEP Reports:


    This item is featured on the following reading lists, Wikipedia, or ReplicationWiki pages:
    1. Economic Logic blog


    Access and download statistics


    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:aah:aarhec:2011-05. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (). General contact details of provider: .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.