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

Eliana Pepa Risma

Mathematical Social Sciences, 2015, vol. 73, issue C, 6-12

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.

Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489614000791
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:73:y:2015:i:c:p:6-12

DOI: 10.1016/j.mathsocsci.2014.11.001

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().