TL;DR
This paper introduces a novel privacy-preserving integer programming protocol that computes exact solutions to the kidney exchange problem, outperforming existing methods while safeguarding sensitive medical data.
Contribution
It presents an innovative privacy-preserving protocol based on Integer Programming that achieves exact solutions with improved performance and extended output for better decision transparency.
Findings
Outperforms existing privacy-preserving approaches in efficiency
Provides exact solutions to the KEP under privacy constraints
Evaluates information leakage from extended output
Abstract
The kidney exchange problem (KEP) is to find a constellation of exchanges that maximizes the number of transplants that can be carried out for a set of pairs of patients with kidney disease and their incompatible donors. Recently, this problem has been tackled from a privacy perspective in order to protect the sensitive medical data of patients and donors and to decrease the potential for manipulation of the computing of the exchanges. However, the proposed approaches to date either only compute an approximative solution to the KEP or they suffer from a huge decrease in performance. In this paper, we suggest a novel privacy-preserving protocol that computes an exact solution to the KEP and significantly outperforms the other existing exact approaches. Our novel protocol is based on Integer Programming which is the most efficient method for solving the KEP in the non privacy-preserving…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
