Sciweavers

662 search results - page 2 / 133
» Classified Stable Matching
Sort
View
TCS
2008
15 years 3 days 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
99
Voted
MOR
2006
122views more  MOR 2006»
15 years 4 days ago
Many-to-One Stable Matching: Geometry and Fairness
Ba
Jay Sethuraman, Chung-Piaw Teo, Liwen Qian
JCO
2008
102views more  JCO 2008»
15 years 5 days 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»
15 years 11 hour 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