A characterization of strongly stable fractional matchings
PA Neme, J Oviedo - Top, 2020 - Springer
PA Neme, J Oviedo
Top, 2020•SpringerIn 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.
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.
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.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果