The Hospitals/Residents problem is a many-to-one extension of the stable marriage problem. In its instance, each hospital specifies a quota, i.e., an upper bound on the number of positions it provides. It is well-known that in any instance, there exists at least one stable matching , and finding one can be done in polynomial time. In this paper, we consider… (More)
Figures and Tables
Sorry, we couldn't extract any figures or tables for this paper.