4 papers · 1 filter
Assignment Maximization
Mustafa Oğuz Afacan, Inácio Bó, Bertan Turhan
We evaluate the goal of maximizing the number of individuals matched to acceptable outcomes. We show that it implies incentive, fairness, and implementation impossibilities. Despit…
Dynamic Reserves in Matching Markets
Orhan Aygün, Bertan Turhan
We study a school choice problem under affirmative action policies where authorities reserve a certain fraction of the slots at each school for specific student groups, and where s…
Slot-specific Priorities with Capacity Transfers
Michelle Avataneo, Bertan Turhan
In many real-world matching applications, there are restrictions for institutions either on priorities of their slots or on the transferability of unfilled slots over others (or bo…
Matching with Generalized Lexicographic Choice Rules
Orhan Aygün, Bertan Turhan
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 institutio…