521 search results - page 1 / 105 » On Stable Matchings and Flows |
WG
2010
Springer
13 years 3 months ago
2010
Springer
DAM
2007
13 years 4 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...
SIAMDM
2011
12 years 11 months ago
2011
For stable marriage (SM) and solvable stable roommates (SR) instances, it is known that there are stable matchings that assign each participant to his or her (lower/upper) median ...
ALGORITHMICA
2010
13 years 5 months ago
2010
Let I be a stable matching instance with N stable matchings. For each man m, order his (not necessarily distinct) N partners from his most preferred to his least preferred. Denote...
ALGORITHMICA
2010
13 years 5 months ago
2010
We consider a high-multiplicity generalization of the classical stable matching problem known as the stable allocation problem, introduced by Ba