Saint Louis University |
Computer Science 314
|
Dept. of Math & Computer Science |
Topic: Stable Marriage
Related Reading: Ch. 1
Due:
Friday, 1 Februrary 2008 (snow)
Monday, 4 February 2008
Please make sure you adhere to the policies on academic integrity.
See "Solved Exercises" in Chapter 1 of text
Decide whether you think the following statement is true or false. If it is true, given a short justification. If it is false, give a counterexample.
Consider an instance of the Stable Matching Problem in which there exists a man m and a woman w such that m is ranked first on the preference list of w and w is ranked first on the preference list of m. then in every stable matching S for thisinstance, the pair (m, w) belongs to S.
Decide whether you think the following statement is true or false. If it is true, given a short justification. If it is false, give a counterexample.
For any valid stable matching S, there must be at least one person who is paired with the person ranked first on his or her preference list.
Exercise 5 of Chapter 1 (pp. 24-25)
Exercise 6 of Chapter 1 (pp. 25-26)