Failure-aware kidney exchange
Algorithmic matches in fielded kidney exchanges do not typically result in an actual transplant.We address the problem of cycles and chains in proposed matches failing after the matching algorithm has committed to them. We show that failure-aware kidney exchange can significantly increase the expect...
Main Authors: | Dickerson, J.P (Author), Procaccia, A.D (Author), Sandholm, T. (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
INFORMS Inst.for Operations Res.and the Management Sciences
2019
|
Subjects: | |
Online Access: | View Fulltext in Publisher |
Similar Items
-
Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover
by: Selçuk Topal, et al.
Published: (2016-10-01) -
Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover
by: Selçuk Topal, et al.
Published: (2016-10-01) -
Negative (and positive) circles in signed graphs: A problem collection
by: Thomas Zaslavsky
Published: (2018-04-01) -
Cycle decompositions and constructive characterizations
by: Irene Heinrich, et al.
Published: (2019-10-01) -
Multidesigns for the graph pair formed by the 6-cycle and 3-prism
by: Yizhe Gao, et al.
Published: (2020-04-01)