The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that either satisfy a set of additional contraints or are optimal with respect to some cost function. In this paper, we show that broad classes of feasibility and optimization stable matching problems in the HR setting can be solved efficiently provided certain tasks (such as checking the feasibility of a stable matching or computing the cost of a stable matching) can also be done efficiently. To prove our results, we make use of an HR instance's meta-rotation poset to explore its stable matchings. An algorithm that can discover all the meta-rotations of the instance serves as a starting point for all our algorithms. © 2008 Elsevier B.V. All rights reserved.
Cheng, C., McDermid, E., & Suzuki, I. (2008). A unified approach to finding good stable matchings in the hospitals/residents setting. Theoretical Computer Science, 400(1–3), 84–99. https://doi.org/10.1016/j.tcs.2008.02.014