Results 91 to 100 of about 12,042 (183)
Lower bounds for the stable marriage problem and its variants [PDF]
, 1988 In an instance of the stable marriage problem of size n, n men and n women each ranks members of the opposite sex in order of preference. A stable marriage is a complete matching M = {(m_1, w_i_1), (m_2, w_i_2), ..., (m_n, w_i_n)} such that no unmatched ...
Hirschberg, Daniel S., Ng, Cheng
core
Lattice Linear Predicate Algorithms for the Constrained Stable Marriage Problem with Ties
, 2022 We apply Lattice-Linear Predicate Detection Technique to derive parallel and distributed algorithms for various variants of the stable matching problem. These problems are: (a) the constrained stable marriage problem (b) the super stable marriage problem
Garg, Vijay K.
core
Multiple stable states in microbial communities explained by the stable marriage problem. [PDF]
ISME J, 2018 Goyal A, Dubinkina V, Maslov S.
europepmc +1 more source
Manilulation via endowments in university-admission problem [PDF]
We consider a two-sided many-to-one matching model where universities offer scholarships to students. We show that every stable matching rule is manipulable by a university via destroying endowments under a fairly wide class of scholarship rules ...
İpek Özkal-Sanver +1 more
core
, 2015 The stable marriage problem is a well-known problem of matching women to men to achieve a certain type of "stability". Each person expresses a strict preference ordering over the members of the opposite sex.
Hibistu, Ehite Mulugeta
core
The Unsplittable Stable Marriage Problem
, 2008 The Gale-Shapley “propose/reject” algorithm is a wellknown procedure for solving the classical stable marriage problem. In this paper we study this algorithm in the context of the many-to-many stable marriage problem, also known as the stable allocation ...
Michel X. Goemans +2 more
core
The Stability of the Roommate Problem Revisited [PDF]
The lack of stability in some matching problems suggests that alternative solution concepts to the core might be applied to find predictable matchings. We propose the absorbing sets as a solution for the class of roommate problems with strict preferences.
Iñarra García, María Elena +2 more
core
A Parallel Approach to the Stable Marriage Problem
, 1994 This paper describes two parallel algorithms for the stable marriage problem implemented on a MIMD parallel computer. The algorithms are tested against sequential algorithms on randomly generated and worst-case instances.
Jesper Larsen
core
The PRO-GRESS model: A conceptual framework for gender-responsive reproductive health promotion among survivors of child marriage. [PDF]
Dialogues HealthMulyaningsih EA +4 more
europepmc +1 more source
A parallel approach to the stable marriage problem
, 1997 This paper describes two parallel algorithms for the stable marriage problem implemented on a MIMD parallel computer. The algorithms are tested against sequential algorithms on randomly generated and worst-case instances.
Larsen, Jesper
core