All finite lattices arise as stable matching lattices under path-independent choice functions, via new representation tools and a hardness result for minimum-cost stable matchings.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
All finite lattices are stable matching lattices
All finite lattices arise as stable matching lattices under path-independent choice functions, via new representation tools and a hardness result for minimum-cost stable matchings.