Show simple item record

dc.contributor.advisorKoray, Semihen_US
dc.contributor.authorKarakaya, Mehmeten_US
dc.date.accessioned2016-07-01T10:59:07Z
dc.date.available2016-07-01T10:59:07Z
dc.date.issued2003
dc.identifier.urihttp://hdl.handle.net/11693/29404
dc.descriptionCataloged from PDF version of article.en_US
dc.description.abstractIn this thesis, we have studied the graduate admission problem with quota and budget constraints as a two sided matching market. We constructed algorithms which are extensions of the Gale - Shapley algorithm and showed that if the algorithms stop then the resulting matchings are core stable (and thus Pareto optimal). However the algorithms may not stop for some problems. Also it is possible that the algorithms do not stop and there is a core stable matching. Also there is no department optimal matching and no student optimal matching under budget constraints. Hence straightforward extensions of the Gale - Shapley algorithm do not work for the graduate admission problem with quota and budget constraints. The presence of budget constraints play an important role in these results.en_US
dc.description.statementofresponsibilityKarakaya, Mehmeten_US
dc.format.extentvii, 54 leavesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectpairwise stable matchingen_US
dc.subjectquota and budget constraintsen_US
dc.subjectthe Gale - Shapley algorithmen_US
dc.subjectPareto optimal matchingen_US
dc.subjectcore stable matchingen_US
dc.subject.lccHB135 .K373 2003en_US
dc.subject.lcshEconomics, Mathematical.en_US
dc.titleGraduate admission problem with quota and budget constraintsen_US
dc.typeThesisen_US
dc.departmentDepartment of Economicsen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidBILKUTUPB072200


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record