Fair and Efficient Student Placement with Couples

Details

Serval ID
serval:BIB_661AC70D8BA1
Type
Article: article from journal or magazin.
Collection
Publications
Title
Fair and Efficient Student Placement with Couples
Journal
International Journal of Game Theory
Author(s)
Klaus B., Klijn F.
ISSN
0020-7276
Publication state
Published
Issued date
2007
Peer-reviewed
Oui
Volume
36
Number
2
Pages
177-207
Language
english
Abstract
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.
Keywords
Student placement, Fairness, Efficiency, Couples, Acyclic priority structure
Web of science
Open Access
Yes
Create date
13/04/2010 15:11
Last modification date
20/08/2019 15:22
Usage data