The algorithm to determine the highest priority of enrollees in the 2023 admissions campaign

In 2023, changes to the admissions procedure came into force which affected enrollment in educational programs of higher education – bachelor's programs, specialty programs, master's programs for the academic year 2023/2024. The main innovation of the future admission campaign is the enrollment of applicants based on priorities. By prioritization, the applicant demonstrates his or her desire to be enrolled in specific fields of study in a particular order. The authors concluded that there is a problem associated with the lack of an algorithm that helps to automatically determine the highest priorities of the applicant at each stage of enrollment. Therefore, the purpose of the study is indicated – to develop an appropriate algorithm. The Gale-Shapley algorithm and its scope are considered – in particular, the possibility of using it to stable matching between applicants and competition groups. It was concluded that this algorithm cannot be employed by educational organizations of higher education in the 2023 admissions campaign due to the existing assumptions in its operation. We have proposed our own methods for solving the problem of determining the highest priorities according to the approved admission rules for the academic year 2023/2024. The article presents a mathematical model of the problem and the computational part of a computer program using Python programming language. The algorithm will be tested at Admiral Makarov State University Maritime and Inland Shipping during the admission campaign in 2023. The materials of the article are of practical value for the admission commissions of educational organizations.

1. Gale D., Shapley L.S. College admissions and the stability of marriage. The American Mathematical Monthly. 1962;69(1):9–15. DOI: 10.1080/00029890.1962.11989827.

2. Roth A.E. The college admissions problem is not equivalent to the marriage problem. Journal of Economic Theory. 1985;36(2):277–288. DOI: 10.1016/0022-0531(85)90106-1.

3. Balinski M., Sönmez T.A. Tale of two mechanisms: student placement. Journal of Economic Theory. 1999;84(1):73–94. DOI: 10.1006/jeth.1998.2469.

4. Abdulkadiroğlu A., Sönmez T. School choice: a mechanism design approach. American Economic Review. 2003;93(3):729–747. DOI: 10.1257/000282803322157061.

5. Kiselgof S.G. Admission campaign modeling: universities of different quality and applicants with a quadratic utility function. Problemy upravleniya = Control sciences. 2012;5:33–40. (In Russ.).

6. Zhelezova E.B., Izmalkov S.B., Sonin K.I., Khovanskaya I.A. Two-sided markets: theory and applications (Nobel Memorial Prize in Economics 2012). Voprosy ekonomiki. 2013;1:4–26. DOI: 10.32609/0042-8736-2013-1-4-26. (In Russ.).

7. Ivashko A.A., Konovalchikova E.N., Mazalov V.V. Game-theoretic hierarchical models of choice. Proceedings of XII All-Russia conference on management issues at VSPU-2014, 16–19 July 2014, Moscow. Moscow, IPU RAN; 2014. p. 8308–8313. (In Russ.).

8. Ryskin K.E., Al A.M.A., Fedosin S.A. Implementation of the Gale-Shapley algorithm for automating reception of university applicants. Vestnik Mordovskogo universiteta = Mordovia University Bulletin. 2016;26(4):462–474. DOI: 10.15507/0236-2910.026.201604.462-474. (In Russ.).

9. Ryskin K.E., Al A.M.A., Fedosin S.A. Adaptation of the Gale-Shapley algorithm for the problem of admission of applicants to a higher educational institution. Proceedings of XLV Ogarev Conference, 08–13 December 2016, Saranck. Saransk, National Research Ogarev Mordovia State University; 2017. p. 683–687. (In Russ.).

10. Makarova A.F., Bezglasnaya E.A. Prospects of development of regional educational services market based the algorithm of Gale-Shapley. Legacy of Nobel laureates in economics: Proceedings of All-Russia scientific and practical conference for young researchers, 09 June 2016, Samara. Samara, Samara State University of Economics; 2016. p. 159–163. (In Russ.).

11. Rogova V.A., Shamin R.V. Optimization procedures in the problem of marketing educational services at the stage of forming a policy for recruiting applicants to universities. Rossiiskii tekhnologicheskii zhurnal = Russian Technological Journal. 2020;8(5):91–102. DOI: 10.32362/2500-316X-2020-8-5-91-102. (In Russ.).

12. Aidarov M.A., Serov D.Yu. Development on the basis of artificial intelligence methods of the predictive model of the admission campaign of the university. Matematicheskie metody v tekhnologiyakh i tekhnike = Mathematical Methods in Technics and Technologies. 2021;11:115–119. DOI: 10.52348/2712-8873_MMTT_2021_11_115. (In Russ.).

13. Vlasova E.E. Application of Gale–Shepley’s algorithm for enrollment of entrants in higher education institutions. Economics and innovations: Proceedings of inter-university scientific and practical conference, 12 November 2021, Moscow. Moscow, Russian University of Economics named after G.V. Plekhanov; 2022. p. 128–131. (In Russ.).