https://github.com/maxkapur/assignment

Lightweight implementation of proposal and rotation algorithms for optimal stable assignment.
https://github.com/maxkapur/assignment

Last synced: 2 months ago
JSON representation

Lightweight implementation of proposal and rotation algorithms for optimal stable assignment.

• Host: GitHub
• URL: https://github.com/maxkapur/assignment
• Owner: maxkapur
• License: bsd-2-clause
• Created: 2020-10-08T07:50:59.000Z (over 4 years ago)
• Default Branch: main
• Last Pushed: 2022-08-26T07:05:07.000Z (over 2 years ago)
• Last Synced: 2025-01-22T12:31:55.414Z (4 months ago)
• Language: Python
• Homepage:
• Size: 9.13 MB
• Stars: 0
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: readme.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# assignment

This module provides a lightweight implementation of the Gale-Shapley stable assignment (proposal) algorithm and a few tools for exploring the stable assignment polytope, including a modified implementation of the optimal stable marriage algorithm described by in the following reference:

- Irving, Robert W., Paul Leather, and Dan Gusfield. 1987. “An Efficient Algorithm for the ‘Optimal’ Stable Marriage.” *Journal of the Association for Computing Machinery* 34, no. 3 (July): 532–43.

![Visualizing preference lists](exs/viz_prefs.png)

![An optimal stable assignment](exs/rot_digraph.png)

Please see the Jupyter notebooks in the root directory for usage examples and a mathematical discussion of the rotation algorithm.

The author’s homepage is [maxkapur.com](https://www.maxkapur.com/).