ACMSE
2010
ACM
13 years 10 months ago
2010
ACM
Although it takes O(n2 ) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identic...
ECAI
2010
Springer
13 years 11 months ago
2010
Springer
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
DAM
2002
14 years 10 days 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...
TCS
2008
14 years 13 days ago
2008
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...
JCO
2008
14 years 15 days 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...
SODA
2008
ACM
14 years 1 months ago
2008
ACM
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
ATAL
2009
Springer
14 years 7 months ago
2009
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has ...
ALDT
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...