# Lecture02 - Announcements CSE 421 Algorithms Richard...

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

1 CSE 421 Algorithms Richard Anderson Autumn 2006 Lecture 2 Announcements • It’s on the web. • Homework 1, Due October 4 – It’s on the web • Subscribe to the mailing list • Richard’s office hours: – Tuesday, 2:30-3:20 pm, Friday, 2:30-3:20 pm. • Ning’s office hours: – Monday, 12:30-1:20 pm, Tuesday, 4:30-5:20 pm. Algorithm Initially all m in M and w in W are free While there is a free m w highest on m’s list that m has not proposed to if w is free, then match (m, w) else suppose (m 2 , w) is matched if w prefers m to m 2 unmatch (m 2 , w) match (m, w) A closer look • Stable matchings are not necessarily fair m 1 : w 1 w 2 w 3 m 2 : w 2 w 3 w 1 m 3 : w 3 w 1 w 2 w 1 : m 2 m 3 m 1 w 2 : m 3 m 1 m 2 w 3 : m 1 m 2 m 3 m 1 m 2 m 3 w 1 w 2 w 3 How many stable matchings can you find? Algorithm under specified • Many different ways of picking m’s to propose • Surprising result – All orderings of picking free m’s give the same result • Proving this type of result – Reordering argument – Prove algorithm is computing something mores specific • Show property of the solution – so it computes a specific stable matching Proposal Algorithm finds the best possible solution for M

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 02/25/2012 for the course CSE 421 taught by Professor Richardanderson during the Fall '06 term at University of Washington.

### Page1 / 4

Lecture02 - Announcements CSE 421 Algorithms Richard...

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

View Full Document
Ask a homework question - tutors are online