Kidney exchange: Further utilization of donors via listed exchange

详细信息    查看全文

• 作者：Ö ; zgü ; r Y谋lmaz ; ^{ozyilmaz@ku.edu.tr" class="auth_mail}
• 关键词：Kidney exchange ; Gallai&ndash ; Edmonds Decomposition
• 刊名：Journal of Mathematical Economics
• 出版年：March, 2014
• 年：2014
• 卷：51
• 期：Complete
• 页码：178-186
• 全文大小：450 K

文摘

There is a set of incompatible patient-donor pairs and these pairs are matched pairwise. A match between two pairs corresponds to a paired kidney donation, where pairs exchange donated kidneys, or a paired listed exchange, where the first donor donates a kidney to the deceased donor wait-list, the first patient receives the kidney of the second donor, and the second patient receives a priority on the wait-list. We characterize the set of exchanges with the maximum number of transplants from the set of pairs. This characterization generalizes the well-known Gallai-Edmonds Decomposition Theorem.