Assigning Candidate Tutors to Modules: A Preference Adjustment Matching Algorithm (PAMA)
Matching problems arise in various settings where two or more entities need to be matched—such 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 algorit...
Saved in:
| Main Authors: | Nikos Karousos, Despoina Pantazi, George Vorvilas, Vassilios S. Verykios |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-04-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-4893/18/5/250 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Rank-Based Assignment Lottery for an Assignment Problem
by: Claudia Meo
Published: (2025-06-01) -
Comparative study of whale optimization algorithm and flower pollination algorithm to solve workers assignment problem
by: Huthaifa Al-Khazraji
Published: (2022-01-01) -
The Application of the Rabin-Karp Algorithm with the Synonym Recognition Approach to Detect Plagiarism in Student Assignments
by: Irma Handayani, et al.
Published: (2024-10-01) -
A Simulated Annealing Algorithm for the Generalized Quadratic Assignment Problem
by: Alan McKendall, et al.
Published: (2024-11-01) -
Learners’ preferences towards Corrective feedback in writing assignments in tertiary education
by: Horbacauskiene Jolita, et al.
Published: (2015-12-01)