84 search results - page 2 / 17 » Approximation Algorithms for the Sex-Equal Stable Marriage P... |
AAMAS
2011
Springer
13 years 9 days ago
2011
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 a...
ALDT
2009
Springer
13 years 12 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...
ICALP
1999
Springer
13 years 9 months ago
1999
Springer
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and seve...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
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 ...
COCOON
2003
Springer
13 years 10 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...