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.

Optimal Selection of Training Courses for Unemployed People based on Stable Marriage Model

The Process of College Selection Using Stable Matching Algorithm

Stable Big-Little Matching

This repo contains the core foundational algos and data structures

Refined the Gale-Shapley algorithm by recalculating stable matchings in bipartite graphs, incorporating dynamic updates for edge deletions, achieving O(N) time complexity for edge deletions, enhancing computational efficiency.

Rust implementation of a modified stable matching problem.

Stable matching algorithm from "College Admissions and the Stability of Marriage" paper by Gale, D.; Shapley, L. S. (1962)