Unformatted text preview: his or her lowest-ranked preference. Problem 4: Unique stable matching Suppose that all men have identical preference lists in an instance of the stable marriage problem. Show that there exists exactly one stable matching. Problem 5: More than one stable matching Suppose that more than one woman receives her lowest-ranked choice when the men propose. Prove that there exist at least two stable matchings between the men and the women. 1...
View Full Document
- Spring '06
- Quantification, Stable marriage problem, M4, stable matchings