Deferred Acceptance in the Marriage Market
This is an example of output from a program that shows the deferred acceptance (Gale-Shapley) algorithm in a 1:1 matching problem (colloquially the stable marriage problem).
This is just static output to illustrate the program; there's no code being run here.
You can click here to read the wiki on this problem.
Click here to see the example, and here to see the code for the website and the algorithm on my github.
This is the men-proposing version, preferences are generated randomly, and everyone prefers any match to no match.