We investigate the matching algorithm used by the German central clearinghouse for university admissions (ZVS) in … criteria applied for admission they all make use of priority matching. In priority matching schemes, it is not a dominant … applicants, we are able to detect some amount of strategic behaviour which can lead to inefficient matching. Alternative ways to …

We investigate the matching algorithm used by the German central clearinghouse for university admissions (ZVS) in … criteria applied for admission they all make use of priority matching. In priority matching schemes, it is not a dominant … applicants, we are able to detect some amount of strategic behaviour which can lead to inefficient matching. Alternative ways to …

We investigate the matching algorithm used by the German central clearinghouse for university admissions (ZVS) in … criteria applied for admission they all make use of priority matching. In priority matching schemes, it is not a dominant … applicants, we are able to detect some amount of strategic behaviour which can lead to inefficient matching. Alternative ways to …

. Complete information equilibrium outcomes are shown to be characterized by a \emph{stability} condition that is adapted to the … \emph{institutional constraints} of the German system. I introduce \emph{matching problems with complex constraints} and the … notion of \emph{procedural stability}. Two simple assumptions guarantee existence of a student optimal procedurally stable …