Improving Policy-Constrained Kidney Exchange via Pre-Screening

• URL: http://arxiv.org/abs/2010.12069v1
• Date: Thu, 22 Oct 2020 21:07:36 GMT
• Title: Improving Policy-Constrained Kidney Exchange via Pre-Screening
• Authors: Duncan C McElfresh, Michael Curry, Tuomas Sandholm, John P Dickerson
• Abstract summary: Barter exchanges are subject to many forms of uncertainty--in participant preferences, the feasibility and quality of various swaps, and so on. Our work is motivated by kidney exchange, a real-world barter market in which patients in need of a kidney transplant swap their willing living donors, in order to find a better match. Planned transplants often fail for a variety of reasons--if the donor organ is refused by the recipient's medical team. One US-based exchange estimated that about 85% of planned transplants failed in 2019.
• Score: 96.27605972266296
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In barter exchanges, participants swap goods with one another without exchanging money; exchanges are often facilitated by a central clearinghouse, with the goal of maximizing the aggregate quality (or number) of swaps. Barter exchanges are subject to many forms of uncertainty--in participant preferences, the feasibility and quality of various swaps, and so on. Our work is motivated by kidney exchange, a real-world barter market in which patients in need of a kidney transplant swap their willing living donors, in order to find a better match. Modern exchanges include 2- and 3-way swaps, making the kidney exchange clearing problem NP-hard. Planned transplants often fail for a variety of reasons--if the donor organ is refused by the recipient's medical team, or if the donor and recipient are found to be medically incompatible. Due to 2- and 3-way swaps, failed transplants can "cascade" through an exchange; one US-based exchange estimated that about 85% of planned transplants failed in 2019. Many optimization-based approaches have been designed to avoid these failures; however most exchanges cannot implement these methods due to legal and policy constraints. Instead we consider a setting where exchanges can query the preferences of certain donors and recipients--asking whether they would accept a particular transplant. We characterize this as a two-stage decision problem, in which the exchange program (a) queries a small number of transplants before committing to a matching, and (b) constructs a matching according to fixed policy. We show that selecting these edges is a challenging combinatorial problem, which is non-monotonic and non-submodular, in addition to being NP-hard. We propose both a greedy heuristic and a Monte Carlo tree search, which outperforms previous approaches, using experiments on both synthetic data and real kidney exchange data from the United Network for Organ Sharing.

Related papers

• Optimizing Hard-to-Place Kidney Allocation: A Machine Learning Approach to Center Ranking [0.4893345190925178]
  This paper proposes a data-driven, machine learning-based ranking system for allocating hard-to-place kidneys to centers. Our experiments demonstrate that the proposed policy can reduce the average number of centers considered before placement by fourfold for all kidneys and tenfold for hard-to-place kidneys.
  arXiv  Detail & Related papers  (2024-10-10T17:15:41Z)
• Penalties and Rewards for Fair Learning in Paired Kidney Exchange Programs [4.963350442999301]
  A kidney exchange program, also called a kidney paired donation program, can be viewed as a repeated, dynamic trading and allocation mechanism. We confirm this hypothesis using a full scale simulation of the Canadian Kidney Paired Donation Program. We find that the most critical factor in determining the performance of a kidney exchange program is not the judicious assignment of positive weights (rewards) to patient-donor pairs.
  arXiv  Detail & Related papers  (2023-09-23T16:25:49Z)
• Multi-Task Learning for Post-transplant Cause of Death Analysis: A Case Study on Liver Transplant [65.85767739748901]
  Post-transplant cause of death provides powerful tool for clinical decision making. Traditional methods like Model for End-stage Liver Disease (MELD) score and conventional machine learning (ML) methods are limited in CoD analysis. We propose a novel framework called CoD-MTL leveraging multi-task learning to model the semantic relationships between various CoD prediction tasks jointly.
  arXiv  Detail & Related papers  (2023-03-30T01:31:49Z)
• Fairly Predicting Graft Failure in Liver Transplant for Organ Assigning [61.30094367351618]
  Liver transplant is an essential therapy performed for severe liver diseases. Machine learning models could be unfair and trigger bias against certain groups of people. This work proposes a fair machine learning framework targeting graft failure prediction in liver transplant.
  arXiv  Detail & Related papers  (2023-02-18T18:24:58Z)
• Cross-Site Severity Assessment of COVID-19 from CT Images via Domain Adaptation [64.59521853145368]
  Early and accurate severity assessment of Coronavirus disease 2019 (COVID-19) based on computed tomography (CT) images offers a great help to the estimation of intensive care unit event. To augment the labeled data and improve the generalization ability of the classification model, it is necessary to aggregate data from multiple sites. This task faces several challenges including class imbalance between mild and severe infections, domain distribution discrepancy between sites, and presence of heterogeneous features.
  arXiv  Detail & Related papers  (2021-09-08T07:56:51Z)
• Learning $\mathbf{\mathit{Matching}}$ Representations for Individualized Organ Transplantation Allocation [98.43063331640538]
  We formulate the problem of learning data-driven rules for organ matching using observational data for organ allocations and transplant outcomes. We propose a model based on representation learning to predict donor-recipient compatibility. Our model outperforms state-of-art allocation methods and policies executed by human experts.
  arXiv  Detail & Related papers  (2021-01-28T01:33:21Z)
• Aligning with Heterogeneous Preferences for Kidney Exchange [7.858296711223292]
  We propose a methodology for prioritizing patients based on heterogeneous moral preferences. We find that this methodology increases the average rank of matched patients in the sampled preference ordering, indicating better satisfaction of group preferences.
  arXiv  Detail & Related papers  (2020-06-16T21:16:53Z)
• Adapting a Kidney Exchange Algorithm to Align with Human Values [59.395925461012126]
  We provide an end-to-end methodology for estimating weights of individual participant profiles in a kidney exchange. We show how to use these weights in kidney exchange market clearing algorithms.
  arXiv  Detail & Related papers  (2020-05-19T21:00:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.