TY - JOUR
T1 - Fair and efficient student placement with couples
AU - Klaus, Bettina
AU - Klijn, Flip
PY - 2007/1/1
Y1 - 2007/1/1
N2 - We study situations of allocating positions to students based on priorities. An example is the assignment of medical students to hospital residencies on the basis of entrance exams. For markets without couples, e.g., for undergraduate student placement, acyclicity is a necessary and sufficient condition for the existence of a fair and efficient placement mechanism (Ergin in Econometrica 70:2489-2497, 2002). We show that in the presence of couples acyclicity is still necessary, but not sufficient. A second necessary condition is priority-togetherness of couples. A priority structure that satisfies both necessary conditions is called pt-acyclic. For student placement problems where all quotas are equal to one we characterize pt-acyclicity and show that it is a sufficient condition for the existence of a fair and efficient placement mechanism. If in addition to pt-acyclicity we require reallocation- and vacancy-fairness for couples, the so-called dictator- bidictator placement mechanism is the unique fair and efficient placement mechanism. Finally, for general student placement problems, we show that pt-acyclicity may not be sufficient for the existence of a fair and efficient placement mechanism. We identify a sufficient condition such that the so-called sequential placement mechanism produces a fair and efficient allocation. © 2007 Springer Verlag.
AB - We study situations of allocating positions to students based on priorities. An example is the assignment of medical students to hospital residencies on the basis of entrance exams. For markets without couples, e.g., for undergraduate student placement, acyclicity is a necessary and sufficient condition for the existence of a fair and efficient placement mechanism (Ergin in Econometrica 70:2489-2497, 2002). We show that in the presence of couples acyclicity is still necessary, but not sufficient. A second necessary condition is priority-togetherness of couples. A priority structure that satisfies both necessary conditions is called pt-acyclic. For student placement problems where all quotas are equal to one we characterize pt-acyclicity and show that it is a sufficient condition for the existence of a fair and efficient placement mechanism. If in addition to pt-acyclicity we require reallocation- and vacancy-fairness for couples, the so-called dictator- bidictator placement mechanism is the unique fair and efficient placement mechanism. Finally, for general student placement problems, we show that pt-acyclicity may not be sufficient for the existence of a fair and efficient placement mechanism. We identify a sufficient condition such that the so-called sequential placement mechanism produces a fair and efficient allocation. © 2007 Springer Verlag.
KW - Acyclic priority structure
KW - Couples
KW - Efficiency
KW - Fairness
KW - Student placement
UR - https://www.scopus.com/pages/publications/34848874161
U2 - 10.1007/s00182-006-0059-9
DO - 10.1007/s00182-006-0059-9
M3 - Article
SN - 0020-7276
VL - 36
SP - 177
EP - 207
JO - International Journal of Game Theory
JF - International Journal of Game Theory
IS - 2
ER -