41 search results - page 2 / 9 » Compact Preference Representation in Stable Marriage Problem... |
DAM
2002
13 years 4 months ago
2002
We consider the stable marriage problem where participants are permitted to express indifference in their preference lists (i.e., each list can be partially ordered). We prove tha...
JCO
2008
13 years 4 months ago
2008
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
DAM
2008
13 years 4 months ago
2008
ALGORITHMICA
2010
13 years 5 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...