An analysis of the German university admissions system
Alexander Westkamp ()
Economic Theory, 2013, vol. 53, issue 3, 589 pages
Abstract:
This paper analyzes the sequential admissions procedure for medical subjects at public universities in Germany. Complete information equilibrium outcomes are shown to be characterized by a stability condition that is adapted to the institutional constraints of the German system. I introduce matching problems with complex constraints and the notion of procedural stability. Two simple assumptions guarantee existence of a student optimal procedurally stable matching mechanism that is strategyproof for students. In the context of the German admissions problem, this mechanism weakly Pareto dominates all equilibrium outcomes of the currently employed procedure. Applications to school choice with affirmative action are also discussed. Copyright Springer-Verlag 2013
Keywords: University admissions; Matching; Stability; Strategyproofness; Complex constraints; C78; D02 (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (79)
Downloads: (external link)
http://hdl.handle.net/10.1007/s00199-012-0704-4 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joecth:v:53:y:2013:i:3:p:561-589
Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/199/PS2
DOI: 10.1007/s00199-012-0704-4
Access Statistics for this article
Economic Theory is currently edited by Nichoals Yanneils
More articles in Economic Theory from Springer, Society for the Advancement of Economic Theory (SAET) Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().