Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 8, No 1 (2020): Electronic Journal of Graph Theory and Applications

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

Nasia Zacharia (University of Patras)
Evi Papaioannou (University of Patras & CTI "Diophantus")
Christos Kaklamanis (University of Patras & CTI "Diophantus")

Article Info

Publish Date
01 Apr 2020

Abstract

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 can be finally assigned to a single Firm. We present an efficient implementation of the Gale and Shapley "propose-and-reject" algorithm when applied to the case of the Firms/Candidates problem.

Copyrights © 2020




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Electronic Journal of Graph Theory and Applications (EJGTA)
Website

Abbrev

ejgta

Publisher

Indonesian Combinatorial Society

Subject

Electrical & Electronics Engineering

Description

The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to all areas of modern graph theory together with applications to other fields of mathematics, computer science and other sciences. The journal is published by the Indonesian Combinatorial Society ...