Results 241 to 250 of about 7,398,457 (268)
Some of the next articles are maybe not open access.
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
On the Likely Number of Solutions for the Stable Marriage Problem
Combinatorics, Probability and Computing, 2009An instance of a size-n stable marriage problem involves n men and n women, each individually ranking all members of opposite sex in order of preference as a potential marriage partner. A complete matching, a set of n marriages, is called stable if no unmatched man and woman prefer each other to their partners in the matching.
Craig Lennon, Boris G. Pittel
openaire +2 more sources
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 +2 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 +2 more sources
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 +2 more sources
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 +2 more sources
Approximation algorithms for the sex-equal stable marriage problem
ACM Transactions on Algorithms, 2010Shuichi Miyazaki
exaly
A shortlist-based bidirectional local search for the stable marriage problem
Journal of Experimental and Theoretical Artificial Intelligence, 2020Le Hong Trang, Viet Hoang
exaly