Stable Marriage Algorithm for a matchmaking application
-
Updated
Mar 22, 2018 - Java
Stable Marriage Algorithm for a matchmaking application
Implemented Gale Shapley Algorithm for stable marriage problem, reference from Algorithm Design by Keleinberg Tardos
Command line stable-matching program for the purpose of matching fraternity Bigs and Littles based on their preferences. Implements the Gale-Shapley algorithm for the stable marriage problem.
This job matching system matches employers and students based on the rank/match process using the Gale-Shapley algorithm. Based on the stable marriage problem.
Stable matching/marriage algorithm implemented using the Builder Pattern
Information system of graph, actors, allocations of actors on the graph, generates an optimal allocation, evaluates its metrics, finds shortest path for an actor from one vertex to another
Optimal Selection of Training Courses for Unemployed People based on Stable Marriage Model
Projet Orientation: Développement d'une application permettant l'affectation des étudiants à des filières sélectives (type ParcourSup). Projet de fin d'année dans le cadre de notre 1ère année en cycle ingénieur.
Add a description, image, and links to the stable-marriage-problem topic page so that developers can more easily learn about it.
To associate your repository with the stable-marriage-problem topic, visit your repo's landing page and select "manage topics."