Sciweavers

13 search results - page 1 / 3
» Approximation algorithms for hard variants of the stable mar...
Sort
View
IWPEC
2009
Springer
13 years 11 months ago
Stable Assignment with Couples: Parameterized Complexity and Local Search
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 ...
Dániel Marx, Ildikó Schlotter
ATAL
2009
Springer
13 years 11 months ago
Manipulation and gender neutrality in stable marriage procedures
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 ...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
AAMAS
2011
Springer
13 years 13 hour ago
Manipulation complexity and gender neutrality in stable marriage procedures
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...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
ECAI
2010
Springer
13 years 3 months ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
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...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...