134 search results - page 5 / 27 » Adaptive stable marriage algorithms |
ICALP
1999
Springer
13 years 11 months ago
1999
Springer
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and seve...
ICDCS
2009
IEEE
14 years 4 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
ALGORITHMICA
2010
13 years 7 months ago
2010
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents ...
CTRSA
2007
Springer
13 years 11 months ago
2007
Springer
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...