{"id":182056,"date":"2009-03-30T00:00:00","date_gmt":"2009-10-31T09:19:33","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/msr-research-item\/computational-thinking-for-a-modern-kidney-exchange\/"},"modified":"2016-09-09T10:02:31","modified_gmt":"2016-09-09T17:02:31","slug":"computational-thinking-for-a-modern-kidney-exchange","status":"publish","type":"msr-video","link":"https:\/\/www.microsoft.com\/en-us\/research\/video\/computational-thinking-for-a-modern-kidney-exchange\/","title":{"rendered":"Computational Thinking for a Modern Kidney Exchange"},"content":{"rendered":"<div class=\"asset-content\">\n<p>In kidney exchanges, patients with kidney disease can obtain compatible donors by swapping their own willing but incompatible donors.  The clearing problem involves finding a social welfare maximizing set of non-overlapping short cycles.  We proved this NP-hard.  It was one of the main obstacles to a national kidney exchange.  We presented the first algorithm capable of clearing these exchanges optimally on a nationwide scale. The key was incremental problem formulation. We adapted two paradigms for this: constraint generation and column generation.  For each, we developed techniques that dramatically improve runtime and memory usage.<\/p>\n<p>Furthermore, clearing is an online problem where patient-donor pairs and altruistic donors appear and expire over time.  We developed trajectory-based online stochastic optimization algorithms (that use our optimal offline solver as a subroutine) for this.  I will discuss design parameters and tradeoffs.  Our best online algorithms outperform the current practice of solving each batch separately.<\/p>\n<p>I will share my experiences from using these algorithms in real kidney exchanges, and the generalizations we introduced.  For one, we used them to launch the first never-ending altruistic donor chains.  I am also helping UNOS design the nationwide kidney exchange; I will discuss current design considerations.<\/p>\n<p>The talk will cover the following papers:<\/p>\n<ul>\n<li>A Nonsimultaneous, Extended, Altruistic-Donor Chain.  New England Journal of Medicine 360(11), March 2009.  (With Rees, M., Kopke, J., Pelletier, R., Segev, D., Rutter, M., Fabrega, A., Rogers, J., Pankewycz, O., Hiller, J., Roth, A., \u00dcnver, U., and Montgomery, R.)<\/li>\n<li>Online Stochastic Optimization in the Large: Application to Kidney Exchange.  Draft, 2009. (With Awasthi, P.)<\/li>\n<li>Clearing Algorithms for Barter Exchange Markets: Enabling Nationwide Kidney Exchanges.  Proc. ACM Conference on Electronic Commerce, 2007.  (With Blum, A. and Abraham, D.)<\/li>\n<\/ul>\n<p>I thank for funding NSF, and Microsoft Research that funds the Computational Thinking Center at Carnegie Mellon.<\/p>\n<\/div>\n<p><!-- .asset-content --><\/p>\n","protected":false},"excerpt":{"rendered":"<p>In kidney exchanges, patients with kidney disease can obtain compatible donors by swapping their own willing but incompatible donors. The clearing problem involves finding a social welfare maximizing set of non-overlapping short cycles. We proved this NP-hard. It was one of the main obstacles to a national kidney exchange. We presented the first algorithm capable [&hellip;]<\/p>\n","protected":false},"featured_media":194432,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"footnotes":""},"research-area":[],"msr-video-type":[],"msr-locale":[268875],"msr-impact-theme":[],"msr-pillar":[],"class_list":["post-182056","msr-video","type-msr-video","status-publish","has-post-thumbnail","hentry","msr-locale-en_us"],"msr_download_urls":"","msr_external_url":"https:\/\/youtu.be\/tKVtWg4bJO8","msr_secondary_video_url":"","msr_video_file":"","_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/182056"}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-video"}],"version-history":[{"count":0,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/182056\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media\/194432"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=182056"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=182056"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=182056"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=182056"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=182056"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=182056"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}