The stable marriage problem: structure and algorithms
The stable marriage problem: structure and algorithms
Stable marriage and indifference
CO89 Selected papers of the conference on Combinatorial Optimization
Male optimal and unique stable marriages with partially ordered preferences
CARE@AI'09/CARE@IAT'10 Proceedings of the CARE@AI 2009 and CARE@IAT 2010 international conference on Collaborative agents - research and development
Hi-index | 0.00 |
In this paper, we study the concepts of male optimality and uniqueness of stable marriages for partially ordered preferences. We give an algorithm to find a stable marriage that is male optimal, and a sufficient condition on the preferences, which guarantees the uniqueness of stable marriages.