25 search results - page 4 / 5 » Stable marriage problems with quantitative preferences |
ACMSE
2010
ACM
13 years 4 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...
ICALP
1999
Springer
13 years 10 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...
CONSTRAINTS
1999
13 years 6 months ago
1999
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
CP
2006
Springer
13 years 8 months ago
2006
Springer
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
IWPEC
2009
Springer
14 years 25 days ago
2009
Springer
We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents ...