The Set of Super-stable Marriages Forms a Distributive Lattice
نویسنده
چکیده
Relaxing the total orders of the preference lists of an instance of the stable marriage problem to arbitrary pose& we show after adjusting the notion of stability to the new problem that the set of stable marriages still forms a distributive lattice.
منابع مشابه
The structure of stable marriage with indifference
We consider the stable marriage problem where participants are permitted to express indifference in their preference lists (i.e., each list can be partially ordered). We prove that, in an instance where indifference takes the form of ties, the set of strongly stable matchings forms a distributive lattice. However, we show that this lattice structure may be absent if indifference is in the form ...
متن کاملOn lattice of basic z-ideals
For an f-ring with bounded inversion property, we show that , the set of all basic z-ideals of , partially ordered by inclusion is a bounded distributive lattice. Also, whenever is a semiprimitive ring, , the set of all basic -ideals of , partially ordered by inclusion is a bounded distributive lattice. Next, for an f-ring with bounded inversion property, we prove that is a complemented...
متن کاملTotal graph of a $0$-distributive lattice
Let £ be a $0$-distributive lattice with the least element $0$, the greatest element $1$, and ${rm Z}(£)$ its set of zero-divisors. In this paper, we introduce the total graph of £, denoted by ${rm T}(G (£))$. It is the graph with all elements of £ as vertices, and for distinct $x, y in £$, the vertices $x$ and $y$ are adjacent if and only if $x vee y in {rm Z}(£)$. The basic properties of the ...
متن کامل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...
متن کاملStable Topology for 0-distributive lattices
In this paper, we introduce and study the stable topology on the set of prime filters of a bounded 0-distributive lattice. The stable topology is a subtopology of the hull kernel topology on the set of prime filters of a bounded 0-distributive lattice. Sufficient condition is given under which the hull kernel topology and stable topology coincide on the set of prime filters (the set of maximal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 58 شماره
صفحات -
تاریخ انتشار 1995