284 search results - page 1 / 57 » What Matchings Can Be Stable |
MOR
2008
13 years 4 months ago
2008
FC
2006
Springer
13 years 8 months ago
2006
Springer
Existing stable matching algorithms reveal the preferences of all participants, as well as the history of matches made and broken in the course of computing a stable match. This in...
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...
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 ...
SIGMOD
2006
ACM
14 years 5 months ago
2006
ACM
In this paper we analyze the problem of schema matching, explain why it is such a "tough" problem and suggest directions for handling it effectively. In particular, we p...