The Stable Marriage Problem
نویسنده
چکیده
منابع مشابه
The stable marriage problem with restricted pairs
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. In an instance of the STABLE MARRIAGE problem, each of the n men and n women ranks the members of the opposite sex in order of preference. It is well known that at least one stable matching exists for every STABLE MARRIAGE ...
متن کاملBalanced Stable Marriage: How Close is Close Enough?
The Balanced Stable Marriage problem is a central optimization version of the classic Stable Marriage problem. Here, the output cannot be an arbitrary stable matching, but one that balances between the dissatisfaction of the two parties, men and women. We study Balanced Stable Marriage from the viewpoint of Parameterized Complexity. Our “above guarantee parameterizations” are arguably the most ...
متن کاملManipulation and gender neutrality in stable marriage procedures
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. A well-known algorithm to solve this problem is the Gale-Shapley algorithm, which runs in po...
متن کاملHardness results on the man-exchange stable marriage problem with short preference lists
We present two hardness results on the man-exchange stable marriage problem, one of which settles a recent conjecture of Irving on the complexity of determining whether a given instance of the stable marriage problem with short preference lists has a man-exchange stable matching. © 2006 Elsevier B.V. All rights reserved.
متن کاملAn n-ary Constraint for the Stable Marriage Problem
We present an n-ary constraint for the stable marriage problem. This constraint acts between two sets of integer variables where the domains of those variables represent preferences. Our constraint enforces stability and disallows bigamy. For a stable marriage instance with n men and n women we require only one of these constraints, and the complexity of enforcing arc-consistency is O(n) which ...
متن کاملThe Multi-dimensional Stable Marriage Problem and its Application in Chemistry
The stable marriage problem (SM) and its many variants are extensively-studied combinatorial problems with many practical applications. The n-dimensional stable marriage model is proposed, which is initially motivated by a problem arising from chemical graph theory, and an algorithm is given accordingly. This model solves the zero clustering problem of chemical graph polynomials successfully, w...
متن کامل