hw1 - explanation. If false, give a counter-example....

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Homework set #1 1. Decide whether you think the following statement is true or false. If true, give a short explanation. If false, give a counter-example. “In every instance of the Stable Matching Problem, there is a stable matching containing a pair (m,w) such that m is ranked first by w, and w is ranked first by m.” 2. Decide whether you think the following statement is true or false. If true, give a short
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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

Ask a homework question - tutors are online