Gale-Shapley Algorithm Demonstration

Gale-Shapley provides a solution to the stable marriage problem. It can be used to pair items from two sets. In the stable marriage problem, boys are to be matched with girls, but obviously Gale-Shapley can be (and is) used in many different scenarios.

See this explanation of the problem for a better understanding.

Instructions

Once the problem is setup, by clicking the Setup button, there will be a number of rows created.

1. Type in a new name (or leave the default) for each row.
2. Select preferences for each item, highest first to lowest last.

Note: This doesn't work in Internet Explorer and I have no plans to change that. So, if you'd like to try this out, you have to be using a browser that implements W3C standards; that's pretty much any browser except Internet Explorer.

Setup