A solver for the stable marriage problem written in Pharo.
-
Updated
Jan 2, 2018 - Smalltalk
A solver for the stable marriage problem written in Pharo.
SAT implementation of stable matching problem with couples and reference implementations of deferred acceptance algorithms.
Stable Marriage Algorithm for a matchmaking application
PURE (Program for Undergraduate Research) Project
Azure Databricks Notebook that assigs team members to customers based on a set of criteria
An implementation of stable marriage problem in C++.
reactjs visualization of the gale-shapley algorithm
This is a Stable matching program that will take N men and N women and match them using the Gale–Shapley algorithm. This program runs in O(n^2) time.
Design by Contract mechanisms in Eiffel
A solver for 'College Admission Problem with Consent' based on paper 'Legal Assignments and fast EADAM with consent via classical theory of stable matchings'.
Implemented Gale Shapley Algorithm for stable marriage problem, reference from Algorithm Design by Keleinberg Tardos
Solving the Stable Marriage/Matching Problem with the Gale–Shapley algorithm
Repo to simulate the Stable Marriage Problem
SMP, Gale-Shapley algorithm
game-theoretic algorithm implementations
The works are mostly based on Irving's paper An Efficient Algorithm for the “Stable Roommates” Problem (1985)
Bespoke algorithm for tackling one-sided matching problem where we have preferences to consider.
hey these are some college and senior secodary projects . hope you like it
Implementation of Stable matching 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.
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."