Dynamically Stable Matching
summary
Defines dynamic stability for two-sided, irreversible matchings with arrivals, proves existence for any finite horizon (any arrival distribution) by a recursive, constructive argument that adapts deferred acceptance using agents’ pessimistic conjecture about continuations. Shows pairwise blocking restricts to agents available at the same time, individual rationality and participation follow, and static core can differ (two-period example: a static DA outcome is blockable by waiting). No lattice or side-optimal guarantees.
AI-written summary · about