14 search results - page 2 / 3 » Distributed Stable Matching Problems with Ties and Incomplet... |
COCOON
2003
Springer
13 years 9 months ago
2003
Springer
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...
ACID
2006
13 years 6 months ago
2006
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
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...
CORR
2010
Springer
13 years 4 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...
WAOA
2005
Springer
13 years 10 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...