Pareto optimal matchings with lower quotas

Katarína Cechlárová and Tamás Fleiner

Mathematical Social Sciences, 2017, vol. 88, issue C, 3-10

Abstract: We consider the problem of allocating applicants to courses, where each applicant has a capacity, possibly greater than 1, and a subset of acceptable courses that she ranks in a strict order of preference. Each course has a lower and an upper quota, indicating that if it is assigned some applicants then their number has to be between these two bounds. We further suppose that applicants extend their preferences over courses to preferences over bundles of courses lexicographically.

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

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489617300641
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:88:y:2017:i:c:p:3-10

DOI: 10.1016/j.mathsocsci.2017.03.007

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 ().