Matchmaker: the Stable Marriage Game



This is the homepage for Matchmaker, a matching game played with universal rankings. We have a working Java applet of the game, which can be played here. Currently, Java 1.5 is required in your browser to play.

The rules of the game are simple: two players take turns marrying one candidate from the right and the left. Candidates are ranked from most preferred (top) to least preferred (bottom). The player who creates the stable matching (no candidate would prefer a legal change of state) wins. Currently we have the stubborn variant working: players may choose to marry either two unmatched candidates or two candidates who are both matched and both prefer each other to their current mate.


click the picture to play


Visit my games page to try out other playable games.

Matchmaker and Stubborn Matchmaker are copyright 2007 to present, Kyle Burke, Shang-Hua Teng and Boston University.