Implementation of stable solutions in a restricted matching market
I analyze the admission mechanism used in Spanish universities. The system is open to strategic manipulation. This is because students are not allowed to express the whole list of available options. However, the mechanism implements the set of stable matchings in Nash equilibrium and the student's optimum in strong equilibrium. The mechanism also implements the students' optimum, in Nash equilibrium, under the class of "non-reverse" preferences. All these properties come from the fact that colleges do not have the opportunity to misrepresent their preferences.
Volume (Year): 3 (1998)
Issue (Month): 2 ()
|Note:||Received: 30 June 1995 / Accepted: 31 January 1997|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/10058/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:reecde:v:3:y:1998:i:2:p:137-147. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.