This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 2. Decide whether you think the following statement is true or false. If true, give a short explanation. If 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 by w, and w is ranked first by m. Then (m,w) must appear in every stable matching.” Solution: True. Suppose S is a stable matching that contains the pairs (m, w0) and (m0, w), for some m0, w0. However, clearly, (m, w) forms an instability pair, contradicting the stability of S....
View
Full
Document
This note was uploaded on 01/22/2010 for the course CSCI 570 taught by Professor Shamsian during the Fall '06 term at USC.
 Fall '06
 Shamsian
 Algorithms

Click to edit the document details