Why Daycare Waitlists Split Up Siblings — And the Math to Fix It

Anyone who has chased a daycare spot knows the drill: you rank your favorites, you wait, and you pray your two kids end up in the same building. Researchers have now put that headache into mathematical form. Their paper looks at matching families to daycare centers when one family has several children who must be placed together, and when some children are already enrolled but hoping to transfer somewhere better. It is the same kind of problem cities face when they run school-choice lotteries.

The trouble is that this combination breaks the usual tidy solutions. In ordinary matching systems, you can often find a 'stable' outcome — one where nobody wants to swap with anyone else. Add siblings and existing enrollments, and stability can simply vanish. So the authors split it into three separate promises: nobody ends up worse off than they started, no family unfairly jumps the line, and no seat sits empty while someone wants it.

Their first attempt used 'master lists,' essentially a ranked waitlist, and it failed once transfers were in play. So they invented something called resettlement: if your family gets displaced by a change, you are guaranteed your original spot back. That single safety net restores the guarantee that a good arrangement always exists. They also built an algorithm that protects fairness while leaving only a slightly weaker version of the no-empty-seats rule.

The honest catch is complexity. Checking whether a plan is fair turns out to be easy for computers, but deciding whether a fair plan with zero wasted seats exists is what researchers call NP-complete — a puzzle that becomes impossibly slow to solve as it grows. Finding resettlement-based plans is hard too. Translation: this is theory, not an app you can download, but it points toward enrollment software that handles siblings and mid-year swaps far more gracefully.