Results 1 to 10 of about 12,042 (183)
Matching-Updating Mechanism: A Solution for the Stable Marriage Problem with Dynamic Preferences [PDF]
Entropy, 2022 We studied the stable marriage problem with dynamic preferences. The dynamic preference model allows the agent to change its preferences at any time, which may cause instability in a matching.
Akhmad Alimudin, Yoshiteru Ishida
doaj +4 more sources
The exchange-stable marriage problem [PDF]
Discrete Applied Mathematics, 2005 In this paper we consider instances of stable matching problems, namely the classical stable marriage (SM) and stable roommates (SR) problems and their variants. In such instances we consider a stability criterion that has recently been proposed, that of
Cechlarova, K., Manlove, D.F.
core +3 more sources
A constraint programming approach to the stable marriage problem [PDF]
2016 International Conference on Advanced Computing and Applications (ACOMP), 2001 The Stable Marriage problem (SM) is an extensively-studied combinatorial problem with many practical applications. In this paper we present two encodings of an instance I of SM as an instance J of a Constraint Satisfaction Problem.
Gent, Ian Philip +15 more
core +3 more sources
A specialised binary constraint for the stable marriage problem [PDF]
, 2005 We present a specialised binary constraint for the stable marriage problem. This constraint acts between a pair of integer variables where the domains of those variables represent preferences. Our constraint enforces stability and disallows bigamy. For a
Unsworth, C. +3 more
core +2 more sources
The stable marriage problem with master preference lists [PDF]
Discrete Applied Mathematics, 2008 We study variants of the classical stable marriage problem in which the preferences of the men or the women, or both, are derived from a master preference list.
Sandy Scott +8 more
core +2 more sources
Approximability results for stable marriage problems with ties [PDF]
Theoretical Computer Science, 2003 We consider instances of the classical stable marriage problem in which persons may include ties in their preference lists. We show that, in such a setting, strong lower bounds hold for the approximability of each of the problems of finding an ...
Kazuo Iwama +20 more
core +3 more sources
Approximation algorithms for the sex-equal stable marriage problem [PDF]
ACM Transactions on Algorithms, 2010 The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial time algorithm to find one. However, the matching obtained by this algorithm
Kazuo Iwama +2 more
exaly +2 more sources
The stable marriage problem with restricted pairs
Theoretical Computer Science, 2003 A stable matching is a complete matching of men and women such that no man and woman who are not partners both prefer each other to their actual partners under the matching.
Szwarcfiter, Jayme L. +3 more
core +3 more sources
Concerning the maximum number of stable matchings in the stable marriage problem
Discrete Mathematics, 2002 The function, f(n), represents the maximum number of stable matchings possible in an instance of size n of the stable marriage problem. It is shown that f(n) is a strictly increasing function of n, and a result of Knuth's concerning the exponential ...
Edward G Thurber
exaly +2 more sources
Scaling behavior in the stable marriage problem [PDF]
Journal de Physique I, 1997 Scaling behavior in the stable marriage problem / M. Dzierzawa ... - In: Journal de Physique. I. 7. 1997. S.
Dzierzawa, Michael
core +6 more sources