Sciweavers

662 search results - page 2 / 133
» Classified Stable Matching
Sort
View
TCS
2008
13 years 8 months ago
A unified approach to finding good stable matchings in the hospitals/residents setting
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
Christine Cheng, Eric McDermid, Ichiro Suzuki
MOR
2006
122views more  MOR 2006»
13 years 8 months ago
Many-to-One Stable Matching: Geometry and Fairness
Ba
Jay Sethuraman, Chung-Piaw Teo, Liwen Qian
JCO
2008
102views more  JCO 2008»
13 years 8 months ago
Stable matching problems with exchange restrictions
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
Robert W. Irving
DAM
2002
96views more  DAM 2002»
13 years 8 months ago
The structure of stable marriage with indifference
We consider the stable marriage problem where participants are permitted to express indifference in their preference lists (i.e., each list can be partially ordered). We prove tha...
David Manlove