The set of super-stable marriages forms a distributive lattice

Boris Spieker

doi:10.1016/0166-218X(94)00080-W

The set of super-stable marriages forms a distributive lattice

Boris Spieker

Discrete Mathematics and Mathematical Programming

Research output: Contribution to journal › Article › Academic

16 Citations (Scopus)

169 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 language	English
Pages (from-to)	79-84
Journal	Discrete applied mathematics
Volume	58
Issue number	1
DOIs	https://doi.org/10.1016/0166-218X(94)00080-W
Publication status	Published - 1995

Keywords

Poset
Lattice
Stable marriage problem

Access to Document

10.1016/0166-218X(94)00080-WLicence: Other

Spieker95setFinal published version, 423 KBLicence: Other

Cite this

@article{110bacee7b6a49abb4a4938db2ce81fa,

title = "The set of super-stable marriages forms a distributive lattice",

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.",

keywords = "Poset, Lattice, Stable marriage problem",

author = "Boris Spieker",

year = "1995",

doi = "10.1016/0166-218X(94)00080-W",

language = "English",

volume = "58",

pages = "79--84",

journal = "Discrete applied mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - The set of super-stable marriages forms a distributive lattice

AU - Spieker, Boris

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

KW - Poset

KW - Lattice

KW - Stable marriage problem

U2 - 10.1016/0166-218X(94)00080-W

DO - 10.1016/0166-218X(94)00080-W

M3 - Article

SN - 0166-218X

VL - 58

SP - 79

EP - 84

JO - Discrete applied mathematics

JF - Discrete applied mathematics

IS - 1

ER -

The set of super-stable marriages forms a distributive lattice

Abstract

Keywords

Access to Document

Fingerprint

Cite this