On the lattice structure of the set of stable matchings for a many-to-one model

Ruth Martínez, Jordi Massó, Alejandro Neme, Jorge Oviedo

Research output: Contribution to journalArticleResearchpeer-review

20 Citations (Scopus)

Abstract

For the many-to-one matching model with firms having substitutable and q-separable preferences we propose two very natural binary operations that together with the unanimous partial ordering of the workers endow the set of stable matchings with a lattice structure. We also exhibit examples in which, under this restricted domain of firms' preferences, the classical binary operations may not even be matchings. © 2001 OPA (Overseas Publishers Association) N.V. Published by license under the Gordon and Breach Science Publishers imprint, a member of the Taylor & Francis Group.
Original languageEnglish
Pages (from-to)439-457
JournalOptimization
Volume50
Issue number5-6
Publication statusPublished - 1 Dec 2001

Keywords

  • Lattice
  • Many-to-one matchings
  • Stability

Fingerprint Dive into the research topics of 'On the lattice structure of the set of stable matchings for a many-to-one model'. Together they form a unique fingerprint.

Cite this