14 search results - page 3 / 3 » Distributed Stable Matching Problems with Ties and Incomplet... |
ALGORITHMICA
2010
13 years 5 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 ...
ESA
2007
Springer
13 years 11 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...
ESA
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for e...
SIGMOD
2011
ACM
12 years 8 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...