Results 11 to 20 of about 303,366 (308)
On the Multidimensional Stable Marriage Problem [PDF]
, 2015 We provide a problem definition of the stable marriage problem for a general number of parties $p$ under a natural preference scheme in which each person has simple lists for the other parties.
Lichtman, Jared D.
core +4 more sources
Beauty and Distance in the Stable Marriage Problem [PDF]
Physica A: Statistical Mechanics and its Applications, 2000 The stable marriage problem has been introduced in order to describe a complex system where individuals attempt to optimise their own satisfaction, subject to mutually conflicting constraints.
A. Capocci +5 more
core +5 more sources
Local search for stable marriage problems
, 2010 The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to any two-sided market.
Gelain, M. +4 more
core +6 more sources
Stable Matchings for a Generalised Marriage Problem [PDF]
SSRN Electronic Journal, 2003 We show that a simple generalisation of the Deferred Acceptance Procedure with men proposing due to Gale and Shapley (1962) yields outcomes for a generalised marriage problem, which are necessarily stable. We also show that any outcome of this procedure is Weakly Pareto Optimal for Men, i.e.
Somdeb Lahiri
+6 more sources
The Stable Marriage Problem and Sudoku
The College Mathematics Journal, 2023 Matvey Borodin +10 more
openalex +2 more sources
The stable marriage problem [PDF]
Communications of the ACM, 1971 The original work of Gale and Shapley on an assignment method using the stable marriage criterion has been extended to find all the stable marriage assignments. The algorithm derived for finding all the stable marriage assignments is proved to satisfy all the conditions of the problem. Algorithm 411 applies to this paper.
D. G. McVitie, L. B. Wilson
openalex +2 more sources
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.
Cseh, Ágnes, Juhos, Attila
openaire +5 more sources
Strategic play in stable marriage problem [PDF]
, 2016 89 pages, 8 sections. Main result in Section 3.
Mircea Digulescu
openalex +3 more sources
Stable marriage problems with quantitative preferences [PDF]
, 2010 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. Such a problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools or more generally to any two-sided market.
Maria Pini +3 more
openalex +4 more sources