Results 21 to 30 of about 2,017,974 (284)
Approximability results for stable marriage problems with ties [PDF]
, 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 +1 more source
Faster and Simpler Approximation of Stable Matchings
Algorithms, 2014 We give a 3 2 -approximation algorithm for finding stable matchings that runs in O(m) time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(n3/2m) time, where n denotes the number of people andm ...
Katarzyna Paluch
doaj +1 more source
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 +1 more source
Proceedings of the AAAI Conference on Artificial Intelligence, 2017 Stable Marriage (SM) is a well-known matching problem, where the aim is to match a set of men and women. The resulting matching must satisfy two properties: there is no unassigned person and there are no other assignments where two people of opposite gender prefer each other to their current assignments.
Genc, Begum +3 more
openaire +2 more sources
The stable marriage problem with master preference lists [PDF]
, 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 +1 more source
Pairwise Preferences in the Stable Marriage Problem [PDF]
ACM Transactions on Economics and Computation, 2021 We study the classical, two-sided stable marriage problem under pairwise preferences. In the most general setting, agents are allowed to express their preferences as comparisons of any two of their edges, and they also have the right to declare a draw or even withdraw from such a comparison.
Ágnes Cseh, Attila Juhos
openaire +6 more sources
Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences
Algorithms, 2013 The stable matching problem (also known as the stable marriage problem) is a well-known problem of matching men to women, so that no man and woman, who are not married to each other, both prefer each other.
Maria Silvia Pini +3 more
doaj +1 more source
Acta Universitatis Carolinae Theologica, 2020 The publication of Amoris laetitia initiated numerous discussions in the circles of theologians who focus on the question of the possibility of sacraments for remarried divorced couples.
Konrad Glombik
doaj +1 more source
Efficient algorithms for generalized Stable Marriage and Roommates problems [PDF]
, 2007 We consider a generalization of the Stable Roommates problem (SR), in which preference lists may be partially ordered and forbidden pairs may be present, denoted by SRPF.
Irving, R.W. +5 more
core +1 more source
On Treewidth and Stable Marriage
CoRR, 2017 Stable Marriage is a fundamental problem to both computer science and economics. Four well-known NP-hard optimization versions of this problem are the Sex-Equal Stable Marriage (SESM), Balanced Stable Marriage (BSM), max-Stable Marriage with Ties (max-SMT) and min-Stable Marriage with Ties (min-SMT) problems.
Sushmita Gupta +2 more
openaire +2 more sources