Chapter 1

The algorithm presented in section 1.1 is a solution to the stable matching problem. The algorithm assumes there are two sets of people, one of n men and one of n women. Each man in the set ranks each woman from 1 to n while the women do the same for the men. Using the sets of men and women and each person's preferences, the algorithm generates a set of pairs that match each man to each woman according to their preferences.