This tool generates the lattice of stable matchings for the College-Admissions Problem. This code is a modification of Simon Mauras's repo for the stable marriage problem. Check it out for more such tools.
The table on the left shows the preferences for the canonical one-to-one instance. The graph in the middle shows the set of rotations and the graph on the right is the lattice of stable matchings arranged from firm-optimal(top) to worker-optimal(bottom).
- This tool requires dot (package graphviz on linux): https://www.graphviz.org/
- Edit the instance (preferences and capacities) in
instance.txt. For reference on what the format for specifying the instance is, refer toinstanceFormat.txt.
- Run
python manage.pyand then openhttp://localhost:8000/. - Modify capacities using the + and - symbols for each of the firm. Please allow some time for new lattice to be calculated and displayed.
Example given in Gusfield and Irving's book:
