Abstract / Excerpt:

This study provides a methodology for the development of an adaptive stable matching algorithm for assigning advisers to advisees, who are conducting their thesis or senior projects, as applied to the Computer Studies Division of the Ateneo de Davao University. Two constraints were effectively integrated into the stable matching algorithm: ranked order list of preferences ( by field of interest) and maximum capacity for the advisers. Stability is measured by the ability of the matching algorithm to the match all advisees to at least one adviser. The one-to-many (advisee-advisees) stable matching algorithm presented in this study was based on the Gale Shapley Algorithm and was modified using the two constraints mentioned above.

Info

Source Institution	Ateneo de Davao University
Unit	Computer Studies
Authors	Cirunay, Wilna Fe T., Laurente, Nikki Shayne L., Kudemus, Gene Miguel P.
Page Count	14
Place of Publication	Davao City
Original Publication Date	February 1, 2011
Tags	Adviser-Advisee Assignment Problem, Stable Matching Algorithm

Preview