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 eit...
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
Brian Aldershof, Olivia M. Carducci, David C. Lore...
Abstract. While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for in...