Adapting a Kidney Exchange Algorithm to Align with Human Values
- URL: http://arxiv.org/abs/2005.09755v1
- Date: Tue, 19 May 2020 21:00:29 GMT
- Title: Adapting a Kidney Exchange Algorithm to Align with Human Values
- Authors: Rachel Freedman, Jana Schaich Borg, Walter Sinnott-Armstrong, John P.
Dickerson, Vincent Conitzer
- Abstract summary: 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.
- Score: 59.395925461012126
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The efficient and fair allocation of limited resources is a classical problem
in economics and computer science. In kidney exchanges, a central market maker
allocates living kidney donors to patients in need of an organ. Patients and
donors in kidney exchanges are prioritized using ad-hoc weights decided on by
committee and then fed into an allocation algorithm that determines who gets
what--and who does not. In this paper, we provide an end-to-end methodology for
estimating weights of individual participant profiles in a kidney exchange. We
first elicit from human subjects a list of patient attributes they consider
acceptable for the purpose of prioritizing patients (e.g., medical
characteristics, lifestyle choices, and so on). Then, we ask subjects
comparison queries between patient profiles and estimate weights in a
principled way from their responses. We show how to use these weights in kidney
exchange market clearing algorithms. We then evaluate the impact of the weights
in simulations and find that the precise numerical values of the weights we
computed matter little, other than the ordering of profiles that they imply.
However, compared to not prioritizing patients at all, there is a significant
effect, with certain classes of patients being (de)prioritized based on the
human-elicited value judgments.
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) - Edema Estimation From Facial Images Taken Before and After Dialysis via
Contrastive Multi-Patient Pre-Training [3.8323580808203785]
Edema is a common symptom of kidney disease, and quantitative measurement of edema is desired.
This paper presents a method to estimate the degree of edema from facial images taken before and after dialysis of renal failure patients.
arXiv Detail & Related papers (2022-12-15T02:05:12Z) - To Impute or not to Impute? -- Missing Data in Treatment Effect
Estimation [84.76186111434818]
We identify a new missingness mechanism, which we term mixed confounded missingness (MCM), where some missingness determines treatment selection and other missingness is determined by treatment selection.
We show that naively imputing all data leads to poor performing treatment effects models, as the act of imputation effectively removes information necessary to provide unbiased estimates.
Our solution is selective imputation, where we use insights from MCM to inform precisely which variables should be imputed and which should not.
arXiv Detail & Related papers (2022-02-04T12:08:31Z) - Optimal discharge of patients from intensive care via a data-driven
policy learning framework [58.720142291102135]
It is important that the patient discharge task addresses the nuanced trade-off between decreasing a patient's length of stay and the risk of readmission or even death following the discharge decision.
This work introduces an end-to-end general framework for capturing this trade-off to recommend optimal discharge timing decisions.
A data-driven approach is used to derive a parsimonious, discrete state space representation that captures a patient's physiological condition.
arXiv Detail & Related papers (2021-12-17T04:39:33Z) - A Deep Learning Approach to Predicting Collateral Flow in Stroke
Patients Using Radiomic Features from Perfusion Images [58.17507437526425]
Collateral circulation results from specialized anastomotic channels which provide oxygenated blood to regions with compromised blood flow.
The actual grading is mostly done through manual inspection of the acquired images.
We present a deep learning approach to predicting collateral flow grading in stroke patients based on radiomic features extracted from MR perfusion data.
arXiv Detail & Related papers (2021-10-24T18:58:40Z) - Adaptively Weighted Top-N Recommendation for Organ Matching [5.585270308006354]
We propose an Adaptively Weighted Top-N Recommendation (AWTR) method for organ matching decision-making.
AWTR improves performance of the current scoring models by using limited actual matching performance in historical data set.
AWTR sacrifices the overall recommendation accuracy by emphasizing the recommendation and ranking accuracy for top-N matched patients.
arXiv Detail & Related papers (2021-07-23T00:42:01Z) - 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) - Improving Policy-Constrained Kidney Exchange via Pre-Screening [96.27605972266296]
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.
arXiv Detail & Related papers (2020-10-22T21:07:36Z) - 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)
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.