There's also a great Freakonomics podcast about this story
<a href="http://freakonomics.com/podcast/make-me-a-match-a-new-freakonomics-radio-episode/" rel="nofollow">http://freakonomics.com/podcast/make-me-a-match-a-new-freako...</a>
NPR RadioLab did an amazing story on this!<p><a href="http://www.npr.org/sections/health-shots/2015/06/11/412224854/how-an-economist-helped-patients-find-the-right-kidney-donor" rel="nofollow">http://www.npr.org/sections/health-shots/2015/06/11/41222485...</a>
Isn't the donor-patient problem a vertex cycle cover? Finding a minimum one is NP-complete, how exactly is this one applied?<p>edit:<p>found a bit more information <a href="https://www.siam.org/news/news.php?id=1474" rel="nofollow">https://www.siam.org/news/news.php?id=1474</a>
There's a great EconTalk podcast episode about Matching Markets with Alvin Roth (the Stanford economist mentioned in the article):<p><a href="http://www.econtalk.org/archives/2015/07/alvin_roth_on_m.html" rel="nofollow">http://www.econtalk.org/archives/2015/07/alvin_roth_on_m.htm...</a>
Might be related, but I recently discovered this<p><a href="http://demonstrations.wolfram.com/SocialGolferProblem/" rel="nofollow">http://demonstrations.wolfram.com/SocialGolferProblem/</a>