Assigning students to blocks of elective courses
Abstract
Importance: the process of assigning university students to blocks of elective courses. Purpose: the development of an algorithm to find a fair matching of students by elective courses and dividing a set of students into «subgroups» for joint study of courses. Research design: the problem is considered as a problem of finding matching in a two-sided market, where the sides to the market are students and elective courses. Assuming that the preferences of agents from the «elective courses» market side are the same for everyone, a modification of the deferred acceptance algorithm is proposed to find a matching. The division of students into «subgroups» is based on a mixed integer programming model. Results: a three-step algorithm is developed in the paper to find an optimal fair matching for assigning students to blocks of elective courses based on their preferences and ratings (academic performances). The numerical results are obtained for full-scale data. They demonstrate the correctness and effectiveness of the proposed approach compared to the procedure that currently used.
Downloads
References
2. Benson Harold. Nonlinear Multiobjective Optimization by Kaisa M. Miettinen // SIAM Review, 2000, no. 42, pp. 339-341.
3. Gale D., Shapley L.S. College Admissions and the Stability of Marriage // The American Mathematical Monthly, 1962, no. 69, pp. 9-15.
4. Heineke M.H., Ballering A.V., Jamin A., Ben Mkaddem S., Monteiro R.C., Van Egmond M. New insights in the pathogenesis of immunoglobulin A vasculitis (HenochSchönlein purpura) // Autoimmun Rev, 2017, no. 16(12), pp. 156-183.
5. Irving R.W. Stable Marriage and Indifference // Discret. Appl. Math., 1994, no. 48, pp. 261-272. 6. Korf R. Multi-Way Number Partitioning // IJCAI International Joint Conference on Artificial Intelligence, 2009, pp. 538-543.
7. Manlove D. Algorithmics of Matching Under Preferences // Bull. EATCS, 2013.
8. Manlove D. Two Algorithms for the Student-Project Allocation Problem // Journal of Discrete Algorithms, 2007.
9. Roth A.E. Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions // International Journal of Game Theory, 2008, no. 36, pp. 537-569.
10. Shimada N., Yamazaki N., Takano Y. Multi-objective Optimization Models for Many-to-one Matching Problems // Journal of Information Processing, 2020, no. 28. pp. 406-412.
11.Tadenuma K. Partnership, Solidarity, and Minimal Envy in Matching Problems // Social Ethics and Normative Economics. Studies in Choice and Welfare. Springer, Berlin, Heidelberg, 2011.
12. Yokoi Y. Envy-Free Matchings with Lower Quotas // Algorithmica, 2020, no. 82, pp. 188-211.
