Skip to content
#

stable-matching-problem

Here are 25 public repositories matching this topic...

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.

  • Updated Sep 20, 2023
  • Python

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.

  • Updated Jul 3, 2024
  • Jupyter Notebook

Improve this page

Add a description, image, and links to the stable-matching-problem topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the stable-matching-problem topic, visit your repo's landing page and select "manage topics."

Learn more