Complex of programs for determining the highest priorities of enrollees in the competitive lists

The article discusses the issues of automation of the functionality of the admission campaign of the educational organization of higher education, in particular, issues related to the introduction of enrollment priorities. The enrollee applies for admission to higher education programs. In it, it denotes individual competitive groups and enrollment priorities for each of them. Based on the information provided, the educational organization of higher education determines the highest priorities for the further enrollment of enrollee. The complex of programs presented in this article is an urgent tool for solving the problem of automatically determining the highest priorities. The complex developed by the authors consists of two subprograms. Each subroutine contains its own implemented algorithm. One of the algorithms for solving the problem is an algorithm based on the use of the «brute force» method (the exhaustive search method). This method has proven its simplicity in implementation and readability of the code. Also, the Gale-Shapley algorithm is implemented in the complex of programs. It is characterized by the search for stable matchings between two groups of participants. Within the framework of this article, the main stages of the complex of programs are presented in detail. Finally, the authors analyzed the results of the implemented algorithms. It is concluded that the algorithms are effective. The results obtained in the article in the form of a complex of programs are proposed to be used by employees of admission commissions of educational institutions of higher education when conducting a new recruitment in terms of automation of determining the highest priorities of applicants in the competitive lists.

1. Ágoston K.C., Biró P., Kováts E., Jankó Z. College admissions with ties and common quotas: Integer programming approach. European Journal of Operational Research. 2022;299(2):722–734. https://doi.org/10.1016/j.ejor.2021.08.033

2. 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. Russian Technological Journal. 2020;8(5):91–102. (In Russ.). https://doi.org/10.32362/2500-316X-2020-8-5-91-102

3. Stepanov M.S., Popov V.G., Fedorova N.K., Kroshin F.S., Muzata A.R., The Automation of Client Servicing in University and College Admission Office. In: 2023 Systems of Signals Generating and Processing in the Field of on Board Communications, 14–16 March 2023, Moscow, Russian Federation. IEEE; 2023. pp. 1–7. https://doi.org/10.1109/IEEECONF56737.2023.10092103

4. Samuel Ya.J., Mustapha R. Design of an Automated Admission Ranking Information System (AARISYS). Physics Access. 2023;03(01):16–21. https://doi.org/10.47514/phyaccess.2023.3.1.003

5. Baryshnikova N.Yu. Implementing digital information and educational environment in a university. In: New Information Technologies in Education: Collection of research papers for the 21st international research-to-practice conference "1C technologies for digitalization of economy and social sector": Part 2, 02–03 February 2021, Moscow, Russia. Moscow: LLC "1C-Publishing"; 2021. pp. 87–90. (In Russ.).

6. Baryshnikova N.Y., Fedkin P.S., Knysh T.P. The algorithm to determine the highest priority of enrollees in the 2023 admissions campaign. Modeling, Optimization and Information Technology. 2023;11(3). (In Russ.). https://doi.org/10.26102/2310-6018/2023.42.3.026

7. Manlove D.F. Algorithmics of Matching Under Preferences. Singapore: World Scientific Publishing Co. Pte. Ltd.; 2013. 524 p.

8. Gale D., Shapley L.S. College Admissions and the Stability of Marriage. The American Mathematical Monthly. 1962;69(1):9–15. https://doi.org/10.1080/00029890.1962.11989827

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

10. Zhelesova E., Izmalkov S., Sonin K., Khovanskaya I. Two-Sided Markets: Theory and Applications (Nobel Memorial Prize in Economics 2012). Voprosy Ekonomiki. 2013;(1):4–26. (In Russ.). https://doi.org/10.32609/0042-8736-2013-1-4-26

11. Budiman M.A., Rachmawati D. Using random search and brute force algorithm in factoring the RSA modulus. Data Science: Journal of Computing and Applied Informatics (JoCAI). 2018;2(1):45–52. https://doi.org/10.32734/jocai.v2.i1-91

12. Thike A.M., Lupin S.A., Balabaev S.A. The features of using a Brute force algorithm for solving a quadratic assignment problem. International Journal of Open Information Technologies. 2023;11(7):60–68. (In Russ.).

13. Thike A.M., Lupin S.A., Khaing M.T. Methods for improving the efficiency of Brute-force algorithm by the example of solving an Unbounded Knapsack Problem. International Journal of Open Information Technologies. 2023;11(5):41–46. (In Russ.).

14. Bó I., Hakimov R. The iterative deferred acceptance mechanism. Games and Economic Behavior. 2022;135:411–433. https://doi.org/10.1016/j.geb.2022.07.001

15. Baryshnikova N.Y. Application of the Gale – Shapley algorithm to determine the highest priority of enrollees in the 2023 admissions campaign. Problems of Modern Education. 2023;(4):245–258. (In Russ.). https://doi.org/10.31862/2218-8711-2023-4-245-258