首页 正文

Stable Matchings with Covering Constraints: A Complete Computational Trichotomy

{{output}}
Stable matching problems with lower quotas are fundamental in academic hiring and ensuring operability of rural hospitals. Only few tractable (polynomial-time solvable) cases of stable matching with lower quotas have been identified; most such problems are NP ... ...