Resolution of SM problem with different algorithms
-
Updated
May 23, 2022 - Jupyter Notebook
Resolution of SM problem with different algorithms
Implemented Gale Shapley Algorithm for stable marriage problem, reference from Algorithm Design by Keleinberg Tardos
A solver for 'College Admission Problem with Consent' based on paper 'Legal Assignments and fast EADAM with consent via classical theory of stable matchings'.
Azure Databricks Notebook that assigs team members to customers based on a set of criteria
Repo to simulate the Stable Marriage Problem
This is python based application which can find a stable allocation for a Stable Matching Game problem.
Algorithms assignments
Teaching Assistant Allocation System
Python implementation of the Gale-Shapley Algorithm.
Command line stable-matching program for the purpose of matching fraternity Bigs and Littles based on their preferences. Implements the Gale-Shapley algorithm for the stable marriage problem.
Solutions to algorithmic programming problems.
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 problem solver for healthcare center internal vacancies.
A cli tool for solving bipartite assignment problems.
reactjs visualization of the gale-shapley algorithm
game-theoretic algorithm implementations
This repository contains a C++ implementation of the Stable Matching Algorithm which solves the Stable Matching Problem (known as the Stable Marriage Problem).
SMP, Gale-Shapley algorithm
1º trabalho prático de algoritmos I, 2021/2
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."