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....
View
Full
Document
This note was uploaded on 10/08/2010 for the course CS 570 at USC.
 '08
 SHAHRIARSHAMSIAN
 Algorithms

Click to edit the document details