Abstract
An upper bound on the diameter of the Stable Matching (Stable Marriage) polytope is known to be ⌊n2⌋ where n is the number of men (or women) involved in the matching. The current work complements that result by providing a lower bound and an algorithm computing it. It also presents a class of Stable Matching instances for which the lower bound coincides with the above-mentioned upper bound.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call