Abstract
In this paper, we characterize the strongly stable fractional matchings for the marriage model as the union of the convex hull of connected sets of stable matchings. Moreover, we present an algorithm that computes the set of matchings necessary to generate the above-mentioned connected sets. Finally, we show that the set of strongly stable fractional matchings has a lattice structure.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
