Implementation of Stable matching Algorithm
-
Updated
Jan 4, 2021 - Python
Implementation of Stable matching Algorithm
Simulating the medical residency match.
This repository contains a Python implementation of the Stable Marriage Algorithm, a mechanism for solving the stable marriage problem. The algorithm is widely used in the field of matching theory to find a stable matching between two sets of elements, such as job applicants and employers or medical students and residency programs.
A Python module to inspect various types of HRTC problems
This repository contains the Gale-Shapley (1962) and Irving's (1985) algorithm's for Stable Matching.
👫🏽 A CLI Python tool to implement the famous Gale-Shapley Algorithm to solve the Stable Matching problem
Observe the affect on stability for incomplete preferences, finding the most popular matching for a complete matrix, and the problem of global stability,
Add a description, image, and links to the stable-matching-problem topic page so that developers can more easily learn about it.
To associate your repository with the stable-matching-problem topic, visit your repo's landing page and select "manage topics."