This paper extends respectively Gale-Shapley¡¦s model and Balinski-Sonmez¡¦s model to analyze the college admission problem and the student placement problem in the case of Taiwan. Given the assumption that time is not considered as a critical dimension of this issue, it is argued that Taiwan¡¦s admission mechanism is in accordance with the criterion of the student optimal stable mechanism with number restriction. As well, the outcome of Taiwan¡¦s admission mechanism exhibits features which are similar to that of the student optimal stable matching with number restriction. However, with regard to Taiwan¡¦s student placement mechanism, it is demonstrated that inefficiency may prevail.
Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0628107-015532 |
Date | 28 June 2007 |
Creators | Huang, Shih-ting |
Contributors | Tung, Yung-nian, Liu, Tru-Gin, Chen, Shih-Shen |
Publisher | NSYSU |
Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
Language | Cholon |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0628107-015532 |
Rights | off_campus_withheld, Copyright information available at source archive |
Page generated in 0.0023 seconds