We present the result of field experiments on three di erent types of course allocation mechanisms. These mechanisms include a first come, first served algorithm used in many universities and two stable matching mechanisms, the Gale-Shapley student optimal stable mechanism (SOSM), and the eciency adjusted deferred acceptance mechanism (EADAM). The latter has been developed only recently. Based on the evaluation of the field data we show that both EADAM and SOSM are preferable compared to the first-come-first-served mechanism. Our findings also demonstrate that EADAM indeed leads to higher eficiency for the students when preferences of course organizers exist. Finally, we survey recent developments on algorithms for multiunit and combinatorial assignment problems, where students have an interest in seats in multiple courses.
There are no subpages or files.