Binary operations and lattice structure for a model of matching with contracts

Abstract

We consider a restricted model of many-to-one matching with contracts and we order the set of stable allocations according both to the unanimous-for-doctors partial ordering and Blair’s partial ordering for hospitals. We define two binary operations to calculate the least upper bound and greatest lower bound for each pair of elements of this set in a simple way. By using these operations, we show that the set of stable allocations has dual lattice structures, thus reflecting an expected counterposition of interests between both sides of the market.