Unformatted text preview: explanation. If false, give a counter-example. “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.” 3. problem 2 from chapter 2 4. problem 3 from chapter 2 5. problem 4 from chapter 2 6. problem 5 from chapter 2...
View Full Document
- Spring '08
- Logic, stable matching problem