Posted by: atri | September 7, 2012

Lect 5: Computing a Stable Matching

In today’s lecture we talked about algorithms to compute a stable matching. We started with developing the Gale Shapley algorithm, which will complete next lecture. The material for today’s lecture as well as the one on Monday is from Sec 1.1 in the textbook.

The slides and notes have been uploaded.

Again, a reminder that you can pick up your graded HW 0 (assuming you submitted it of course) in the TA office hours or recitations starting with Jiun-Jie’s office hour on Monday.


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s


%d bloggers like this: