An instance of Stable matching problem where both one-to-one and many-to-one matching is followed.
-
Updated
May 6, 2018 - Python
An instance of Stable matching problem where both one-to-one and many-to-one matching is followed.
game-theoretic algorithm implementations
Design and Analysis of Algorithms
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.
Projeto 2 de Teoria e Aplicação de Grafos (TAG), disciplina ofertada na Universidade de Brasília (UnB) no semestre 2021.1.
Python module to use the Gale-Shapley algorithm
Python implementation of deferred acceptance algorithm for school choice problem
Multi-preference project allocation for the students by using a customized Gale-Shapley algorithm
The Gale–Shapley algorith is an algorithm for the stable matching problem. It is a truthful mechanism from the po
Repositório de armazenamento de projetos da disciplina Teoria e Aplicação de Grafos realizada no semestre de 2022.2
Observe the affect on stability for incomplete preferences, finding the most popular matching for a complete matrix, and the problem of global stability,
A website for colleges. Students and mentors can give there preferences, the program will than use the Gale-Shapley algorithm to find the best matches.
Implementation of the Gale-Shapley (also known as deferred acceptance) and Top Trading Cycle (TTC) algorithms for 2-sided matching
Animation of the Gale Shapley Algorithm that solves the matching problem of bipartite graphs.
Python implementation of the Gale-Shapley Algorithm.
Add a description, image, and links to the gale-shapley-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the gale-shapley-algorithm topic, visit your repo's landing page and select "manage topics."