7 search results - page 2 / 2 » Local search for stable marriage problems with ties and inco... |
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...