33 search results - page 6 / 7 » The stable marriage problem with master preference lists |
ICIAR
2005
Springer
15 years 3 months ago
2005
Springer
Efficient matching methods are crucial in Image Processing. In the present paper we outline a novel algorithm of ”stable marriages” that is also fair and globally satisfactory ...
WAOA
2005
Springer
15 years 3 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”, ...
ALGORITHMICA
2010
14 years 10 months ago
2010
Knuth [14] asked whether the stable matching problem can be generalised to three dimensions i. e., for families containing a man, a woman and a dog. Subsequently, several authors ...
ALGORITHMICA
2010
14 years 10 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...
WWW
2009
ACM
15 years 10 months ago
2009
ACM
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...