engleski

Ranking model for dormitory admission process

The process of enrolling students in dormitories corresponds to the stable marriage problem, where students and dormitories are matched as two sets. Applying the Gale-Shapley deferred acceptance algorithm ensures a condition of stability where students enroll in their highest priority dormitories while dormitories enroll students according to students’ scores. In comparison with the application for admission in schools and colleges, the dormitory admission process divides the set of students by gender into two subsets. Therefore, there are two sub-quotas for each dormitory, one for each subset of students. In this paper, we present a ranking model for the admission process based on the modified deferred acceptance algorithm. The experimental results show that the proposed model is suitable for the admission process based on the process’ requirements.

stable marriage problem , matching , student ranking , dormitory admission

nije evidentirano