MIT6_042JS10_lec15_prob

# MIT6_042JS10_lec15_prob - Massachusetts Institute of...

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

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.

Unformatted text preview: Massachusetts Institute of Technology 6.042J/18.062J, Spring 10 : Mathematics for Computer Science March 8 Prof. Albert R. Meyer revised March 2, 2010, 734 minutes In-Class Problems Week 6, Mon. Problem 1. Four Students want separate assignments to four VI-A Companies. Here are their preference rankings: Student Albert: Rich: Megumi: Justin: Company AT&T: Justin, Albert, Megumi, Rich Bellcore: Megumi, Rich, Albert, Justin HP: Justin, Megumi, Albert, Rich Draper: Rich, Justin, Megumi, Albert Companies HP, Bellcore, AT&T, Draper AT&T, Bellcore, Draper, HP HP, Draper, AT&T, Bellcore Draper, AT&T, Bellcore, HP Students (a) Use the Mating Ritual to find two stable assignments of Students to Companies. (b) Describe a simple procedure to determine whether any given stable marriage problem has a unique solution, that is, only one possible stable matching. Problem 2. A preserved invariant of the Mating ritual is: For every girl, G , and every boy, B , if G is crossed off B s list, then G has a favorite...
View Full Document

## This note was uploaded on 05/27/2011 for the course CS 6.042J taught by Professor Prof.albertr.meyer during the Spring '11 term at MIT.

### Page1 / 3

MIT6_042JS10_lec15_prob - Massachusetts Institute of...

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

View Full Document
Ask a homework question - tutors are online