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.
|Publication status||Published - 1 Dec 2001|
- Many-to-one matchings