Publications
Detailed Information
Constrained College Admission Problem: Manipulability of Truncated College-optimal Stable Mechanism : 제한적 대학입시제도: 축약 학교최적 안정 메커니즘의 조작가능성
Cited 0 time in
Web of Science
Cited 0 time in Scopus
- Authors
- Advisor
- 김진우
- Major
- 사회과학대학 경제학부
- Issue Date
- 2017-08
- Publisher
- 서울대학교 대학원
- Keywords
- college admission ; matching ; manipulability ; truncated mechanism ; college-optimal stable mechanism
- Description
- 학위논문 (석사)-- 서울대학교 대학원 사회과학대학 경제학부, 2017. 8. 김진우.
- Abstract
- A central issue in college admission problems is their vulnerability to manipulation by students. Students can often falsely report their preferences and get into more preferred colleges. This paper first shows that the college admission mechanisms in South Korea and the US, where students are limited in the number of schools that they can apply to, are equivalent to truncated college-optimal stable mechanism (TCOSM). Then, by adopting the framework proposed by Pathak and Sönmez (2013), it proves that the type space which is vulnerable under TCOSM is equivalent to that incurs different matching under TCOSM and student-optimal stable mechanism (SOSM). The result implies that TCOSM becomes less manipulable as the truncation quota (the limited number of each student's applications) increases, considering the type space which is vulnerable under TCOSM with the lower truncation quota. The analysis on manipulability of TCOSM supports policy reforms that increase the truncation quota to enhance students' satisfaction in college admission.
- Language
- English
- Files in This Item:
- Appears in Collections:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.