The structure of stable marriage with indifference
The author considers the stable marriage problem where participants are permitted to express indifference in their preference list. One proves that, in an instance where indifference takes the form of ties, the set of strongly stable matchings forms a distributive lattice. If indifference is in the form of arbitrary partial order, it turns out that the lattice structure may be absent. On the other hand, for a given stable marriage instance with ties, one characterizes strongly stable matchings in terms of perfect matchings in bipartite graphs.
scientific article; zbMATH DE number 1792360
scientific article