Demonstration of the Gale-Shapley to compute a stable matching

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.

Weekly Kattis exercises, implementing various algorithms introduced in the course on Algorithm Design.

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

A Multi Cloud Marketplace Model with Multiple Brokers for IaaS Layer and Generalized Stable Matching

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.

An extension of the stable marriages problem which implements a novel algorithm that I created. The algorithms finds the optimum invigilation schedule that satisfies a group of n teachers (or other individuals) that must proctor m exams.

Exploring different methods & algorithms, practicing fundamental techniques and terms of algorithm design domain

Stable matching algorithm from "College Admissions and the Stability of Marriage" paper by Gale, D.; Shapley, L. S. (1962)

Simulation of school choice problem

Stable Big-Little Matching