Repo to simulate the Stable Marriage Problem

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

reactjs visualization of the gale-shapley algorithm

A cli tool for solving bipartite assignment problems.

Implementation of Stable matching Algorithm

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

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.

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

A solver for the stable marriage problem written in Pharo.

Simulating the medical residency match.

Graph Theory Applications course semester project

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

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

An implementation of stable marriage problem in C++.

hey these are some college and senior secodary projects . hope you like it

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.

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.