Answers are grounded in this paper and cite their sources.
We study Stable Marriage with Ties and Incomplete lists (SMTI) under weak stability. For an instance with n agents on each side, we give an exact algorithm that returns a maximum-cardinality weakly stable matching in O^*(22.74ⁿ) time. To the best of our knowledge, this is the first exact algorithm for this problem running in single-exponential time.
No takes yet. Share an insight, caveat, or question.
Miyazaki et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: