Design and Analysis of Algorithms

CSE 421, Autumn 2009, University of Washington

Machiavelli and the Gale-Shapley algorithm

Posted by James Lee on October 18, 2009

For those of you who thought about extra credit problem #2, you’ll see that a full proof is perhaps not so easy to come by.  You can see the solution in this paper by Dubins and Freedman.

Leave a Reply

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

WordPress.com Logo

You are commenting using your WordPress.com 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

 
Follow

Get every new post delivered to your Inbox.