Name: | Description: | Size: | Format: | |
---|---|---|---|---|
578.14 KB | Adobe PDF |
Advisor(s)
Abstract(s)
This paper addresses the problem of maximising the expected number of transplants in kidney exchange programmes. New schemes for matching rearrangement in case of failure are presented, along with a new tree search algorithm used for the computation of optimal expected values. Extensive computa-tional experiments demonstrate the effectiveness of the algorithm and reveal a clear superiority of a newly proposed scheme, subset-recourse, as compared to previously known approaches.
Description
Keywords
Kidney exchange programmes Cycle packing Expectation optimisation