2 votes
Accepted

Maximum stable matching/allocation

Your problem is equivalent to MAX SMTI (Stable Marriage with Ties and Incomplete lists). You can find the current best approximation algorithm for MAX SMTI in the following paper: Z. Kiraly, Linear ...
Hiroki Yanagisawa's user avatar
1 vote

Hospital Resident Matching Algorithm with Incomplete Preferences

It's worth noting that some of the great properties that the stable marriage problem has fail in the hospitals and resident model (many-to-one matching). For example, hospital-proposing differed ...
Clay Thomas's user avatar
1 vote
Accepted

Hospital Resident Matching Algorithm with Incomplete Preferences

Yes, in straightforward ways. To accommodate partial lists, the doctors stop proposing after they've been rejected from every hospital in their order, and remain unmatched. The hospitals automatically ...
usul's user avatar
  • 7,615

Only top scored, non community-wiki answers of a minimum length are eligible