490 search results - page 1 / 98 » Impossibilities for roommate problems |
MSS
2010
IEEE
13 years 6 months ago
2010
IEEE
DAM
2007
13 years 7 months ago
2007
We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time a...
IPL
2007
13 years 7 months ago
2007
Recently, a number of interesting algorithmic problems have arisen from the emergence, in a number of countries, of kidney exchange schemes, whereby live donors are matched with r...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...