A Characterization of Strongly Stable Fractional Matchings

In this paper we characterize the strongly stable fractional matchingsfor the marriage model as the union of the convex hull of connected setsof stable matchings. Moreover, we present an algorithm that computes theset of... [ view full 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 have a
lattice structure.