Assignment maximization

Arbeitspapier

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.

Angaben zum Objekt

• Sprache: Englisch

Verweise und Beziehungen

• Erschienen in: Series: WZB Discussion Paper ; No. SP II 2018-201

Klassifikation und Themen

• Klassifikation: Wirtschaft ; Market Design ; Bargaining Theory; Matching Theory ; Equity, Justice, Inequality, and Other Normative Criteria and Measurement
• Thema: market design ; matching ; maximal matching ; fairness ; object allocation ; school choice

Beteiligte, Orts- und Zeitangaben

• Ereignis: Geistige Schöpfung
• (wer): Afacan, Mustafa Oğuz ; Bó, Inácio Guerberoff Lanari ; Turhan, Bertan
• Ereignis: Veröffentlichung
• (wer): Wissenschaftszentrum Berlin für Sozialforschung (WZB)
• (wo): Berlin
• (wann): 2018

Weitere Informationen

• Handle: http://hdl.handle.net/10419/175367
• Letzte Aktualisierung: 20.09.2024, 08:21 MESZ