Sciweavers

13 search results - page 1 / 3
» Stable Marriage with Ties and Bounded Length Preference List...
Sort
View
ACID
2006
239views Algorithms» more  ACID 2006»
13 years 6 months ago
Stable Marriage with Ties and Bounded Length Preference Lists
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...
Robert W. Irving, David Manlove, Gregg O'Malley
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
13 years 4 months ago
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
Dániel Marx, Ildikó Schlotter
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 4 months ago
Local search for stable marriage problems with ties and incomplete lists
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
COCOON
2003
Springer
13 years 9 months ago
Randomized Approximation of the Stable Marriage Problem
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...
Magnús M. Halldórsson, Kazuo Iwama, ...
ICALP
1999
Springer
13 years 8 months ago
Stable Marriage with Incomplete Lists and Ties
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...
Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasu...