h1_sol_r

# h1_sol_r - CSE 202 Homework 1 Solution(Revised TA Nan Zang...

This preview shows pages 1–2. Sign up to view the full content.

CSE 202 Homework 1 Solution (Revised 1/21/2008) TA: Nan Zang Note these are only sketch answers , not full answers. Problem 1 Solution: False Counter example: Two men {m,m’}. Two women {w,w’} m prefers w to w’ m’ prefers w’ to w w prefers m’ to m w’ prefers m to m’. There are two stable matchings: 1. m Ù w’ and m’ Ù w 2. m Ù w and m’ Ù w’. None of them satisfy the condition described by the problem. Problem 2: Solution True Explanation We know w is ranked first in m’s preference list and m is ranked first in w’s preference list. Assume pair (w, m) is not in the stable matching, then w is paired with some other man m’ and m is paired with some other women: m Ù w’ and m’ Ù w. However, m prefers w to its current partner w’ and w prefers m to its current partner m’, which is a contradiction with the definition of stable matching. Problem 3: Solution (b) There are four tv shows total, each station has two. The four tv shows have rating 1, 2, 3, 4 separately:

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 05/21/2008 for the course CS CO453 taught by Professor Graham during the Winter '08 term at UCSD.

### Page1 / 3

h1_sol_r - CSE 202 Homework 1 Solution(Revised TA Nan Zang...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online