Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/150154 
Autor:innen: 
Erscheinungsjahr: 
2011
Quellenangabe: 
[Journal:] Theoretical Economics [ISSN:] 1555-7561 [Volume:] 6 [Issue:] 2 [Publisher:] The Econometric Society [Place:] New Haven, CT [Year:] 2011 [Pages:] 257-267
Verlag: 
The Econometric Society, New Haven, CT
Zusammenfassung: 
In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even when school priorities are publicly known and only students can behave strategically, there is a priority structure for which no robustly stable mechanism exists. Our main result shows that there exists a robustly stable mechanism if and only if the priority structure of schools is acyclic (Ergin, 2002), and in that case, the student-optimal stable mechanism is the unique robustly stable mechanism.
Schlagwörter: 
Matching
stability
strategy-proofness
robust stability
acyclicity
JEL: 
C71
C78
D71
D78
J44
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by-nc Logo
Dokumentart: 
Article

Datei(en):
Datei
Größe





Publikationen in EconStor sind urheberrechtlich geschützt.