Bistable Versions of the Marriages and Roommates Problems
نویسنده
چکیده
A stable matching for an instance of the stable marriages problem or the stable roommates problem is bistable if it is also a stable matching when the ordering of the input preference lists is reversed. For the stable marriages problem, it is shown that the bistable matchings are a sublattice of the distributive lattice of stable matchings. In addition, the Gale Shapley algorithm is modified to find the man-optimal bistable matching and to determine the irreducible bistable matchings. ] 1999 Academic Press
منابع مشابه
A Polynomial-time Algorithm for the Bistable Roommates Problem
In a recent paper, Weems introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming. In addition, we show that several (old and new) results for the bistable marriage and roommates problem become transparent using the polyhedral approac...
متن کاملCellular Automata Simulation of a Bistable Reaction-Diffusion System: Microscopic and Macroscopic Approaches
The Cellular Automata method has been used to simulate the pattern formation of the Schlögl model as a bistable Reaction-Diffusion System. Both microscopic and macroscopic Cellular Automata approaches have been considered and two different methods for obtaining the probabilities in the microscopic approach have been mentioned. The results show the tendency of the system towards the more sta...
متن کاملWeak Force Measurement in Bistable Optomechanical System
One of the main milestones in the study of opto-mechanical system is to increase the sensitivity of weak forces measurement up to the standard quantum limit. We have studied the detection of weak force under a bistable condition in red detuned regime. In this case, dynamics of the system behaves asymptotically similar to stationary state and applying external force affects phase and fluctuation...
متن کاملThe stable matching problem and its generalizations: an algorithmic and game theoretical approach PhD Thesis
We say that a market situation is stable in a general sense, if there is no set of agents such that all of them are interested in creating a new cooperation (after breaking their other eventual cooperations). As a special question, Gale and Shapley [48] introduced and studied the problem of stable marriages. Here a matching, that corresponds to a set of marriages, is stable, if there exists no ...
متن کاملComparison of the frequency of dentoalveolar deformities in consanguineous marriages and non-consanguineous marriages in Kerman, Iran
BACKGROUND AND AIM: Consanguineous marriage is one of the causes of congenital deformities and genetic diseases. The aim of this study was to evaluate the role of consanguineous marriage in dentoalveolar deformities in 16-18 years old adolescents with parental consanguineous marriages in Kerman, Iran. METHODS: A total of 388 female and male adolescents participated in this study. The subjects w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 59 شماره
صفحات -
تاریخ انتشار 1999