Simplified Problem

It turns out that there are some special complications in the Match (couples match, program parity restrictions) that make it difficult to analyze. We'll look at an idealization of this problem.

We've got n boys and n girls. Each boy submits a ROL of all n girls. Ditto for the girls. (How much data do we have?)

A marriage (or matching) is a bijection between girls and boys.


next up previous
Next: Example Up: THE STABLE MARRIAGE PROBLEM Previous: THE STABLE MARRIAGE PROBLEM