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
Unformatted text preview: 6.042/18.062J Mathematics for Computer Science October 1, 2010 Tom Leighton and Marten van Dijk Problems for Recitation 7 1 A Protocol for College Admission Next, we are going to talk about a generalization of the stable marriage problem. Recall that we have some horses and wed like to pair them with stables so that there is no incentive for two horses to swap stables. Oh wait, thats a different problem. The problem were going to talk about is a generalization of the one done in lecture. In the new problem, there are N students s 1 ,s 2 ,...,s N and M universities u 1 ,u 2 ,...,u M . M University u i has n i slots for students, and were guaranteed that i =1 n i = N . Each student ranks all universities (no ties) and each university ranks all students (no ties). Design an algorithm to assign students to universities with the following properties 1. Every student is assigned to one university....
View Full Document
This note was uploaded on 01/19/2012 for the course CS 6.042J / 1 taught by Professor Tomleighton,dr.martenvandijk during the Fall '10 term at MIT.
- Fall '10
- Computer Science