Results 11 to 20 of about 7,398,457 (268)
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. We prove that, in a precise sense, establishing arc consistency in J is equivalent to the action of the established ...
Ian P. Gent +4 more
core +13 more sources
The exchange-stable marriage problem [PDF]
Discrete Applied Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katarína Cechlárová, David F. Manlove
openaire +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.
Chris Unsworth, Patrick Prosser
openaire +3 more sources
Approximability results for stable marriage problems with ties [PDF]
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Magnús M. Halldórsson +6 more
openaire +5 more sources
Stable marriage with incomplete lists and ties [PDF]
, 1999 The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and several relaxations have been proposed, including the following two common ...
Miyazaki, S. +3 more
core +8 more sources
The hospitals/residents problem with ties [PDF]
, 2000 The hospitals/residents problem is an extensively-studied many-one stable matching problem. Here, we consider the hospitals/residents problem where ties are allowed in the preference lists.
Irving, R. W, Manlove, D.F., Scott, S.
core +8 more sources
Scientific Reports, 2023 As laser chaos has been proven to be a robust tool to solve the multi-armed bandit (MAB) problem, this study investigates the problem of multiuser dynamic channel assignment using laser chaos in cognitive radio networks with K-orthogonal channels and M ...
Zengjing Chen, Lu Wang, Chengzhi Xing
doaj +1 more source
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
Subjective Homophily and the Fixtures Problem
Games, 2020 The Stable Fixtures problem (Irving and Scott (2007)) is a generalized matching model that nests the well-known Stable Roommates, Stable Marriage, and College Admissions problems as special cases.
Joseph E. Duggan
doaj +1 more source
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