Python implementation of the Gale-Shapley Algorithm.
-
Updated
Jun 5, 2024 - Python
Python implementation of the Gale-Shapley Algorithm.
This repository contains a Python implementation of the Top Trading Cycle Algorithm, a mechanism for solving the problem of allocating indivisible items or resources among agents with preferences. The algorithm is widely used in the field of matching theory, particularly in the context of school choice and house allocation problems.
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.
Add a description, image, and links to the matching-theory topic page so that developers can more easily learn about it.
To associate your repository with the matching-theory topic, visit your repo's landing page and select "manage topics."