An efficient implementation of the Gale and Shapley "propose-and-reject" algorithm

An efficient implementation of the Gale and Shapley "propose-and-reject" algorithm

We consider a version of the Hospitals/Residents problem which was first defined in 1962 by Gale and Shapley [9] under the name "College Admissions Problem". In particular, we consider the Firms/Candidates problem, where each Firm wishes to hire at least one Candidate and each Candidate ca...

Full description

Bibliographic Details
Main Authors: Nasia Zacharia, Evi Papaioannou, Christos Kaklamanis
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2020-04-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
stable matching
gale and shapley algorithm
the firms/candidates problem
efficient implementation
"propose-and-reject" algorithm
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/745

Internet

https://www.ejgta.org/index.php/ejgta/article/view/745

Similar Items