28 search results - page 2 / 6 » Stability in Matching Problems with Weighted Preferences |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
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 ha...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
ACID
2006
13 years 6 months ago
2006
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...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Many-to-one matching markets exist in numerous different forms, such as college admissions, matching medical interns to hospitals for residencies, assigning housing to college st...