<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">

Publication:
Kidney exchange: further utilization of donors via listed exchange

Loading...
Thumbnail Image

Departments

Item type:Organizational Unit,

School / College / Institute

Program

Organization Authors

Co-Authors

Date

Language

Embargo Status

NO

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

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.

Source

Publisher

Elsevier

Citation

item.page.haspartof

Source

Journal of Mathematical Economics

item.page.ispartofseries

item.page.edition

DOI

10.1016/j.jmateco.2013.09.007

item.page.datauri

item.page.link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

Related Patent

Related Goal

Google Scholar
Scholar'da Ara ↗
Altmetric
Dimensions
PlumX Metrikleri
BIP! Indicators