Wednesdays often require short posts. This one perhaps more so than others.
Tomorrow, I will be talking about some of my thesis work on the impartial game Stubborn Matchmaker. The game is based on pairing candidates in a Stable Matching environment where both sets have a universal preference. The game ends when the matching is stable (the ith candidate on the left is matched to the ith on the right, for all i).
In case you're in the Wittenbergish area (central-western Ohio), feel free to stop by at 4pm for the talk, which will be in room 320 in the Science Center.
Perhaps someone out there will have an answer to how the patterns we see in the game actually work!
A Domino-Covering Problem
2 months ago