{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:11:47Z","timestamp":1760058707938,"version":"build-2065373602"},"reference-count":21,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T00:00:00Z","timestamp":1745539200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Matching problems arise in various settings where two or more entities need to be matched\u2014such as job applicants to positions, students to colleges, organ donors to recipients, and advertisers to ads slots in web advertising platforms. This study introduces the preference adjustment matching algorithm (PAMA), a novel matching framework that pairs elements, which conceptually represent a bipartite graph structure, based on rankings and preferences. In particular, this algorithm is applied to tutor\u2013module assignment in academic settings, and the methodology is built on four key assumptions where each module must receive its required number of candidates, candidates can only be assigned to a module once, eligible candidates based on ranking and module capacity must be assigned, and priority is given to mutual first-preference matches with institutional policies guiding alternative strategies when needed. PAMA operates in iterative rounds, dynamically adjusting modules and tutors\u2019 preferences while addressing capacity and eligibility constraints. The distinctive innovative element of PAMA is that it combines concepts of maximal and stable matching, pending status and deadlock resolution into a single process for matching tutors to modules to meet the specific requirements of academic institutions and their constraints. This approach achieves balanced assignments by adhering to ranking order and considering preferences on both sides (tutors and institution). PAMA was applied to a real dataset provided by the Hellenic Open University (HOU), in which 3982 tutors competed for 1906 positions within 620 modules. Its performance was tested through various scenarios and proved capable of effectively handling both single-round and multi-round assignments. PAMA effectively handles complex cases, allowing policy-based resolution of deadlocks. While it may lose maximality in such instances, it converges to stability, offering a flexible solution for matching-related problems.<\/jats:p>","DOI":"10.3390\/a18050250","type":"journal-article","created":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T06:10:13Z","timestamp":1745561413000},"page":"250","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Assigning Candidate Tutors to Modules: A Preference Adjustment Matching Algorithm (PAMA)"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2530-4820","authenticated-orcid":false,"given":"Nikos","family":"Karousos","sequence":"first","affiliation":[{"name":"School of Science and Technology, Hellenic Open University, 18 Aristotelous St., 263 35 Patras, Greece"}]},{"given":"Despoina","family":"Pantazi","sequence":"additional","affiliation":[{"name":"School of Science and Technology, Hellenic Open University, 18 Aristotelous St., 263 35 Patras, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9472-6774","authenticated-orcid":false,"given":"George","family":"Vorvilas","sequence":"additional","affiliation":[{"name":"School of Humanities, Hellenic Open University, 18 Aristotelous St., 263 35 Patras, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9758-0819","authenticated-orcid":false,"given":"Vassilios","family":"Verykios","sequence":"additional","affiliation":[{"name":"School of Science and Technology, Hellenic Open University, 18 Aristotelous St., 263 35 Patras, Greece"}]}],"member":"1968","published-online":{"date-parts":[[2025,4,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0038-0121(76)90008-2","article-title":"A linear programming solution to the faculty assignment problem","volume":"10","author":"Breslaw","year":"1976","journal-title":"Socio-Econ. Plan. Sci."},{"key":"ref_2","first-page":"226","article-title":"Problema da Distribui\u00e7\u00e3o do Servi\u00e7o Docente: Uma An\u00e1lise Bibliom\u00e9trica desde 1976 at\u00e9 2021","volume":"E55","author":"Moreira","year":"2023","journal-title":"Rev. Ib\u00e9rica Sist. Tecnol. Informa\u00e7\u00e3o"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/S0377-2217(96)00082-3","article-title":"The teacher assignment problem: A special case of the fixed charge transportation problem","volume":"101","author":"Hultberg","year":"1997","journal-title":"Eur. J. Oper. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1016\/j.ejor.2015.08.057","article-title":"A MILP model for the teacher assignment problem considering teachers\u2019 preferences","volume":"249","author":"Domenech","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"679","DOI":"10.56899\/150.04.07","article-title":"Solving Faculty-Course Allocation Problem Using Integer Programming Model","volume":"150","author":"Torres","year":"2021","journal-title":"Philipp. J. Sci."},{"doi-asserted-by":"crossref","unstructured":"Tejada, R., and Martinez, I.A. (2020, January 15\u201318). A two-step approach involving forecasting preferences integrating curriculum, rank, educational attainment and interest, and assignment to shorten teacher-course assignment process. Proceedings of the 2020 IEEE World Conference on Engineering Education (EDUNINE), Bogota, Colombia.","key":"ref_6","DOI":"10.1109\/EDUNINE48860.2020.9149523"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0957-4174(02)00017-9","article-title":"An application of genetic algorithm methods for teacher assignment problems","volume":"22","author":"Wang","year":"2002","journal-title":"Expert Syst. Appl."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1869","DOI":"10.1007\/s12065-020-00438-0","article-title":"Novel operators for quantum evolutionary algorithm in solving timetabling problem","volume":"14","author":"Tayarani","year":"2020","journal-title":"Evol. Intell."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","article-title":"College Admissions and the Stability of Marriage","volume":"69","author":"Gale","year":"1962","journal-title":"Am. Math. Mon."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1086\/261272","article-title":"The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory","volume":"92","author":"Roth","year":"1984","journal-title":"J. Political Econ."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.tcs.2016.09.014","article-title":"Stable matchings of teachers to schools","volume":"653","author":"Fleiner","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian method for the assignment problem","volume":"2","author":"Kuhn","year":"1952","journal-title":"Nav. Res. Logist. Q."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/0105003","article-title":"Algorithms for the Assignment and Transportation Problems","volume":"5","author":"Munkres","year":"1957","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n5\/2 Algorithm for Maximum Matchings in Bipartite Graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Combe, J., Dur, U., Tercieux, O., Terrier, C., and \u00dcnver, M. (2025). Market Design for Distributional Objectives in (Re)assignment: An Application to Improve the Distribution of Teachers in Schools, SSRN.","key":"ref_15","DOI":"10.2139\/ssrn.5112041"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, Trees, and Flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Can. J. Math."},{"doi-asserted-by":"crossref","unstructured":"Maglogiannis, I., Iliadis, L., Macintyre, J., Avlonitis, M., and Papaleonidas, A. (2024). The Faculty Assignment Problem in Higher Education: A Shapley Value-Based Approach. Artificial Intelligence Applications and Innovations, Springer Nature.","key":"ref_17","DOI":"10.1007\/978-3-031-63211-2"},{"doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., and Vazirani, V.V. (1990, January 13\u201317). An optimal algorithm for on-line bipartite matching. Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, Baltimore, MA, USA.","key":"ref_18","DOI":"10.1145\/100216.100262"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1561\/0400000057","article-title":"Online Matching and Ad Allocation","volume":"8","author":"Mehta","year":"2013","journal-title":"Found. Trends Theor. Comput. Sci."},{"unstructured":"Moore, M.G., and Kearsley, G. (2011). Distance Education: A Systems View of Online Learning, Cengage Learning. [3rd ed.].","key":"ref_20"},{"doi-asserted-by":"crossref","unstructured":"Deb, K. (2004). Inequality\u2019s Arrow: The Role of Greed and Order in Genetic Algorithms. Genetic and Evolutionary Computation\u2014GECCO 2004, Springer.","key":"ref_21","DOI":"10.1007\/b98643"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/5\/250\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:21:23Z","timestamp":1760030483000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/5\/250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,25]]},"references-count":21,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2025,5]]}},"alternative-id":["a18050250"],"URL":"https:\/\/doi.org\/10.3390\/a18050250","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2025,4,25]]}}}