The Set of Super-stable Marriages Forms a Distributive Lattice

Relaxing the total orders of the preference lists of an instance of the stable marriage problem to arbitrary posets, we show after adjusting the notion of stability to the new problem that the set of stable marriages still forms a distributive lattice.

[1]  Robert W. Irving,et al.  The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[2]  Robert W. Irving.  Stable Marriage and Indifference , 1994, Discret. Appl. Math..

[3]  David Gale,et al.  Some remarks on the stable matching problem , 1985, Discret. Appl. Math..