A comparison of matching algorithms for kidney exchange programs addressing waiting time

• Type: Article in International Scientific Journal
• Date: 2021

Authors

Monteiro, T (Author) Other; Klimentova, X (Author) Other; Joao Pedro Pedroso (Author) FCUP; Viana, A (Author) Other

Journal

Title: Central European Journal of Operations Research

Vol. 29

Pages: 539-552

ISSN: 1435-246X

Publisher: Springer Nature

Indexing

ISI Web of Knowledge - 4 Citations

Other information

Authenticus ID: P-00R-X3Y

DOI: 10.1007/s10100-020-00680-y

Abstract (EN): Kidney exchange programs (KEP) allow an incompatible patient-donor pair, whose donor cannot provide a kidney to the respective patient, to have a transplant exchange with another in a similar situation if there is compatibility. Exchanges can be performed via cycles or chains initiated by non-directed donors (NDD), i.e., donors that do not have an associated patient. The objective for optimization in KEP is generally to maximize the number of possible transplants. Following the course of recent approaches that consider a dynamic matching (exchanges are decided every time a pair or a NDD joins the pool), in this paper we explore two matching policies to find feasible exchanges: periodic, where the algorithm runs within some period (e.g each 3 month); and greedy, in which a matching run is done as soon as the pool is updated with a new pair or NDD. For each policy, we propose a matching algorithm that addresses the waiting times of pairs in a pool. We conduct computational experiments with the proposed algorithms and compare the results with those obtained when periodic and greedy matching aim at maximizing the number of transplants.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 14