Assignments | Course Home | Schedule & Lecture Notes

Saint Louis University

Computer Science 314
Algorithms

Michael Goldwasser

Spring 2008

Dept. of Math & Computer Science

Homework Assignment 01

Stable Marriage

Contents:


Overview

Topic: Stable Marriage
Related Reading: Ch. 1
Due: Friday, 1 Februrary 2008 (snow)
Monday, 4 February 2008

Please make sure you adhere to the policies on academic integrity.


Practice Problems


Problems to be Submitted (40 points)

  1. (10 points)

    Decide whether you think the following statement is true or false. If it is true, given a short justification. If it is false, give a counterexample.

    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 on the preference list of w and w is ranked first on the preference list of m. then in every stable matching S for thisinstance, the pair (m, w) belongs to S.

  2. (10 points)

    Decide whether you think the following statement is true or false. If it is true, given a short justification. If it is false, give a counterexample.

    For any valid stable matching S, there must be at least one person who is paired with the person ranked first on his or her preference list.

  3. (20 points)

    Exercise 5 of Chapter 1 (pp. 24-25)


Extra Credit

  1. (4 points)

    Exercise 6 of Chapter 1 (pp. 25-26)


Michael Goldwasser © 2008
CSCI 314, Spring 2008
Last modified: Wednesday, 23 January 2008
Assignments | Course Home | Schedule & Lecture Notes