Abstract
We study the problem of centralized allocation of children to public day care centers, illustrated by the case of Denmark. Our framework applies to problems of dynamic matching in which there is entry and exit of agents over time; for example, the school choice problem once student mobility is taken into account. We show that there does not exist any mechanism that is both stable and strategy-proof. We also show that the well-known Top Trading Cycles mechanism is neither Pareto efficient nor strategy-proof. Finally, a mechanism in which parents sequentially choose menus of schools is both strategy-proof and Pareto efficient. (JEL C73, D82, I21)
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
