A student seat allocation system using Gale-Shapley algoirthm written in Django which can be used for college admission after entrance examinations.

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

Projeto 2 de Teoria e Aplicação de Grafos (TAG), disciplina ofertada na Universidade de Brasília (UnB) no semestre 2021.1.

game-theoretic algorithm implementations

Repositório de armazenamento de projetos da disciplina Teoria e Aplicação de Grafos realizada no semestre de 2022.2

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.

Animation of the Gale Shapley Algorithm that solves the matching problem of bipartite graphs.

Design and Analysis of Algorithms

The Gale–Shapley algorith is an algorithm for the stable matching problem. It is a truthful mechanism from the po

Multi-preference project allocation for the students by using a customized Gale-Shapley algorithm

Python module to use the Gale-Shapley algorithm

An instance of Stable matching problem where both one-to-one and many-to-one matching is followed.

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.

Python implementation of the Gale-Shapley Algorithm.

Implementation of the Gale-Shapley (also known as deferred acceptance) and Top Trading Cycle (TTC) algorithms for 2-sided matching

Python implementation of deferred acceptance algorithm for school choice problem