Results 161 to 170 of about 12,042 (183)
Some of the next articles are maybe not open access.
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
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 M. 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
A parallel algorithm to solve the stable marriage problem
BIT, 1984zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. S. Tseng, Richard C. T. Lee
openaire +1 more source
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 Size-Popularity Tradeoff in the Stable Marriage Problem
SIAM Journal on Computing, 2014Given a bipartite graph $G = (\mathcal{A}\cup\mathcal{B}, E)$ where each vertex ranks its neighbors in a strict order of preference, the problem of computing a stable matching is classical and well studied. A stable matching has size at least $\frac{1}{2}|M_{\max}|$, where $M_{\max}$ is a maximum size matching in $G$, and there are simple examples ...
openaire +1 more source
A shortlist-based bidirectional local search for the stable marriage problem
Journal of Experimental and Theoretical Artificial Intelligence, 2020Le Hong Trang, Taechoong Chung
exaly
A Heuristic Repair Algorithm for the Maximum Stable Marriage Problem with Ties and Incomplete Lists
Lecture Notes in Computer Science, 2022Taechoong Chung +2 more
exaly