Solving the Stable Marriage/Matching Problem with the Gale–Shapley algorithm

Repo to simulate the Stable Marriage Problem

reactjs visualization of the gale-shapley algorithm

A cli tool for solving bipartite assignment problems.

Python implementation of the Gale-Shapley Algorithm.

Contains StableMarriage.py, a package that can find stable marriages using the Gale-Shapley algorithm as well as a decentralized random procedure. Moreover, it contains a method that checks for stability.

Implementation of Stable matching Algorithm

SAT implementation of stable matching problem with couples and reference implementations of deferred acceptance algorithms.

The works are mostly based on Irving's paper An Efficient Algorithm for the “Stable Roommates” Problem (1985)

Azure Databricks Notebook that assigs team members to customers based on a set of criteria

Simulating the medical residency match.

A solver for the stable marriage problem written in Pharo.

Graph Theory Applications course semester project

Implemented Gale Shapley Algorithm for stable marriage problem, reference from Algorithm Design by Keleinberg Tardos

This job matching system matches employers and students based on the rank/match process using the Gale-Shapley algorithm. Based on the stable marriage problem.

Stable Marriage Algorithm for a matchmaking application

Bespoke algorithm for tackling one-sided matching problem where we have preferences to consider.

This concise yet powerful implementation delves into the intricacies of matching preferences between two groups, ensuring stability in the pairings.

Projet Orientation: Développement d'une application permettant l'affectation des étudiants à des filières sélectives (type ParcourSup). Projet de fin d'année dans le cadre de notre 1ère année en cycle ingénieur.

An implementation of stable marriage problem in C++.