Skip to content
#

stable-marriage-problem

Here are 44 public repositories matching this topic...

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.

  • Updated Sep 20, 2023
  • Python

This respository contains an extension to the Gale-Shapley algorithm. The extension was presented in the paper "Safety, Stability, and Efficiency of Taxi Rides" authored by Martin Aleksandrov and Tobias Labarta, and accepted for publication at the 22nd EPIA Conference on Artificial Intelligence, 5-8 September 2023, Horta, Portugal.

  • Updated Jun 13, 2023
  • Jupyter Notebook

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

  • Updated May 23, 2023
  • Java

Improve this page

Add a description, image, and links to the stable-marriage-problem topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the stable-marriage-problem topic, visit your repo's landing page and select "manage topics."

Learn more