Results 241 to 250 of about 304,412 (273)
Some of the next articles are maybe not open access.
Three Fast Algorithms for Four Problems in Stable Marriage
SIAM Journal on Computing, 1987The stable marriage problem is a well-known problem of matching n men to n women to achieve a certain type of ``stability''; the \(O(n^ 2)\) time Gale-Shapley algorithm [\textit{D. Gale} and \textit{L.68D30 The author studies the class \({\mathcal K}\) of automata such that an \(\alpha_ 0\)-product of any automata from \({\mathcal K}\) is in ...
Dan Gusfield
openaire +3 more sources
Distributed Weighted Stable Marriage Problem
2010The Stable Matching problem was introduced by Gale and Shapley in 1962. The input for the stable matching problem is a complete bipartite Kn,n graph together with a ranking for each node. Its output is a matching that does not contain a blocking pair, where a blocking pair is a pair of elements that are not matched together but rank each other higher ...
Nir Amira, Ran Giladi, Zvi Lotker
openaire +1 more source
A Generalization of the Stable Marriage Problem
Journal of the Operational Research Society, 1981In this paper we extend the results of Gale and Shapely on the stable marriage problem. The set of participants in an assignment configuration is allowed to expand dynamically as long as certain relative preference conditions are maintained. The impact of this extension on complexity and performance issues are discussed.
openaire +2 more sources
Inapproximability Results on Stable Marriage Problems
2002The stable marriage problem has received considerable attention both due to its practical applications as well as its mathematical structure. While the original problem has all participants ranka ll members of the opposite sex in a strict order of preference, two natural variations are to allow for incomplete preference lists and ties in the ...
Magnús Halldórsson +3 more
openaire +1 more source
The Upper Bound for the Stable Marriage Problem
Journal of the Operational Research Society, 1978The stable problem was originally posed by Gale and Shapley. The worst case performance of their solution is derived in a manner that illustrates the complexity characteristics of the problem. Several conclusions about the nature of the worst case situation are presented.
openaire +1 more source
Improved Approximation of the Stable Marriage Problem
2003The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum size, while any stable matching is a maximal matching and thus trivially a factor two approximation.
Magnús M. Halldórsson +3 more
openaire +1 more source
A network visualization of stable matching in the stable marriage problem
Artificial Life and Robotics, 2011The stable marriage problem (SMP) seeks matchings between n women and n men which would result in stability, and not lead to divorce or extramarital affairs. We have introduced a network consisting of nodes which represent matchings, and links between nodes which attain stability by exchanging a partner between two pairs.
Yoshihisa Morizumi +2 more
openaire +1 more source
The Stable Marriage Problem: Structure and Algorithms
Journal of the Operational Research Society, 1991(1991). The Stable Marriage Problem: Structure and Algorithms. Journal of the Operational Research Society: Vol. 42, No. 3, pp. 263-264.
openaire +1 more source
Better and Simpler Approximation Algorithms for the Stable Marriage Problem
Algorithmica, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source