Economics at your fingertips  

Assignment maximization

Mustafa Afacan, Inácio Guerberoff Lanari Bó and Bertan Turhan

No SP II 2018-201, 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: D47 C78 D63 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-des, nep-gth and nep-mic
Date: 2018
References: Add references at CitEc
Citations: Track citations by RSS feed

Downloads: (external link) (application/pdf)

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:

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

Page updated 2019-11-14
Handle: RePEc:zbw:wzbmbh:spii2018201