Matching with Generalized Lexicographic Choice Rules

Orhan Aygün and Bertan Turhan

ISU General Staff Papers from Iowa State University, Department of Economics

Abstract: Motivated by the need for real-world matching problems, this paper formulates a large class of practical choice rules, Generalized Lexicographic Choice Rules (GLCR), for institutions that consist of multiple divisions. Institutions fill their divisions sequentially, and each division is endowed with a sub-choice rule that satisfies classical substitutability and size monotonicity in conjunction with a new property that we introduce, quota monotonicity. We allow rich interactions between divisions in the form of capacity transfers. The overall choice rule of an institution is defined as the union of the sub-choices of its divisions. The cumulative offer mechanism (COM) with respect to GLCR is the unique stable and strategy-proof mechanism. We define a choice-based improvement notion and show that the COM respects improvements. We employ the theory developed in this paper in our companion paper, Aygün and Turhan (2019b), to design satisfactory matching mechanisms for India with comprehensive affirmative action constraints.

Date: 2019-11-01
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Working Paper: Matching with Generalized Lexicographic Choice Rules (2020)
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:isu:genstf:20191101070000

Access Statistics for this paper

More papers in ISU General Staff Papers from Iowa State University, Department of Economics Iowa State University, Dept. of Economics, 260 Heady Hall, Ames, IA 50011-1070. Contact information at EDIRC.
Bibliographic data for series maintained by Curtis Balmer ().