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

👑 Implementing Gale-Shapley algorithm with Flask & Heroku.

Implementation of Stable matching Algorithm

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

Codes used for paper on mathematical modelling

Simulating the medical residency match.

Graph Theory Applications course semester project

A Python module to inspect various types of HRTC problems

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

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 repository contains the Gale-Shapley (1962) and Irving's (1985) algorithm's for Stable Matching.

Optimal Selection of Training Courses for Unemployed People based on Stable Marriage Model

Refactored Version of Project-Week-2.0. Created based off of (reasonably) good Java programming practices

This repository implements an optimization algorithm for participant-course allocation in the Board of European Students of Technology (BEST). The BEST matching system has been enhanced to improve computational efficiency by adapting approaches from the Stable Marriage problem, specifically the Hospital-Residents (HR) problem.

A solver for 'College Admission Problem with Consent' based on paper 'Legal Assignments and fast EADAM with consent via classical theory of stable matchings'.

Stable Big-Little Matching

This Repository contains my implementation of the gale-shapley algorithm to generate stable matchings. This work is inspired by jeromew21's work

TP1 Algorítmos I 2021/1 - Implementa o Algorítmo de Gale Shapley para gerar soluções estáveis entre postos de vacinação e pessoas

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.

Observe the affect on stability for incomplete preferences, finding the most popular matching for a complete matrix, and the problem of global stability,