The set of super-stable marriages forms a distributive lattice

Boris Spieker

Research output: Contribution to journalArticleAcademic

10 Citations (Scopus)
81 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)79-84
JournalDiscrete applied mathematics
Volume58
Issue number1
DOIs
Publication statusPublished - 1995

Keywords

  • Poset
  • Lattice
  • Stable marriage problem

Fingerprint Dive into the research topics of 'The set of super-stable marriages forms a distributive lattice'. Together they form a unique fingerprint.

Cite this