Search Results for author:
Found 4 papers, 2 papers with code
Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples
We present a novel polynomial-time algorithm that can find a near-feasible stable matching (adjusting the hospitals' capacities by at most 1) in an {\sc hrc} instance where the couples' preferences are sub-responsive (i. e., if one member switches to a better hospital, than the couple also improves) and sub-complete (i. e., each pair of hospitals that are individually acceptable to both members are jointly acceptable for the couple) by reducing it to an instance of the {\sc Stable Fixtures} problem.
A General Framework for Stable Roommates Problems using Answer Set Programming
For that reason, there are also variations of SR that try to find a good-enough solution (e. g., Almost SR).
Algorithms for new types of fair stable matchings
We introduce two new notions of fairness in SMI.
Data Structures and Algorithms
Two-sided profile-based optimality in the stable marriage problem
In this paper we present an $O(n^5\log n)$ algorithm for finding a rank-maximal stable matching using an approach that involves weights that are polynomially-bounded in $n$.
Data Structures and Algorithms 05C85 F.2.1
