Assignment maximization
Mustafa Afacan,
Inácio Guerberoff Lanari Bó and
Bertan Turhan
Discussion Papers, Research Unit: Market Behavior from WZB Berlin Social Science Center
Abstract:
We evaluate the goal of maximizing the number of individually rational assignments. We show that it implies incentive, fairness, and implementation impossibilities. Despite that, we present two classes of mechanisms that maximize assignments. The first are Pareto efficient, and undominated - in terms of number of assignments - in equilibrium. The second are fair for unassigned students and assign weakly more students than stable mechanisms in equilibrium. We provide comparisons with well-known mechanisms through computer simulations. Those show that the difference in number of matched agents between the proposed mechanisms and others in the literature is large and significant.
Keywords: market design; matching; maximal matching; fairness; object allocation; school choice (search for similar items in EconPapers)
JEL-codes: C78 D47 D63 (search for similar items in EconPapers)
Date: 2018
New Economics Papers: this item is included in nep-des, nep-gth and nep-mic
References: Add references at CitEc
Citations: View citations in EconPapers (4)
Downloads: (external link)
https://www.econstor.eu/bitstream/10419/175367/1/1014493501.pdf (application/pdf)
Related works:
Journal Article: Assignment maximization (2023) 
Working Paper: Assignment Maximization (2020) 
Working Paper: Assignment Maximization (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:zbw:wzbmbh:spii2018201
Access Statistics for this paper
More papers in Discussion Papers, Research Unit: Market Behavior from WZB Berlin Social Science Center Contact information at EDIRC.
Bibliographic data for series maintained by ZBW - Leibniz Information Centre for Economics ().