Repo to simulate the Stable Marriage Problem
-
Updated
Jul 9, 2020 - Python
Repo to simulate the Stable Marriage Problem
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
Azure Databricks Notebook that assigs team members to customers based on a set of criteria
The works are mostly based on Irving's paper An Efficient Algorithm for the “Stable Roommates” Problem (1985)
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.
This is python based application which can find a stable allocation for a Stable Matching Game problem.
game-theoretic algorithm implementations
A collection of simple Python visualizations for classic algorithms and data structures.
👩💻This repository provides Python implementations of a variety of fundamental algorithms and problem-solving techniques. From Knapsack and TSP to BFS, DFS, and more, explore practical examples to enhance your algorithmic skills. Perfect for students and developers seeking to grasp essential algorithms in Python.
Simple Implementation of the Stable Marriage Algorithm by Gale-Shapley
Add a description, image, and links to the stable-marriage-problem topic page so that developers can more easily learn about it.
To associate your repository with the stable-marriage-problem topic, visit your repo's landing page and select "manage topics."