Kidney Exchange: An Operations Perspective

Ashlagi, Itai; Roth, Alvin E.

doi:10.2139/ssrn.3795019

Cited by 2 publications

(5 citation statements)

References 94 publications

(135 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This happened in large part because of continued attention to the operational details that arose as obstacles were overcome and new obstacles became relevant. Ashlagi and Roth (2021) review some of the key operational issues in the design of successful kidney exchange programs. They also describe some open questions as kidney exchange has yet to reach its full potential, for example, many patients in need of a kidney transplant have a willing but incompatible (or poorly matched) living donor.…”

Section: Production and Operations Managementmentioning

confidence: 99%

Nobel laureates’ contributions to and impacts on operations management

Sethi

Gupta

Agrawal

et al. 2022

Production and Operations Management

View full text Add to dashboard Cite

Operations management (OM) has evolved to its current status due to the contributions of researchers in many fields including economics, finance, behavioral sciences, operations research/management science, mathematics, statistics, and computer science. Many of these contributors are Nobel laureates—winners of the highest academic award. The Nobel Memorial Prize in Economic Sciences is awarded to those with monumental works in economics. Yet, some winners have also made contributions to operations management, the field of this journal. Others have developed important concepts and techniques that have made an enormous impact on OM research. Here, we describe the OM contributions as well as the impactful concepts of these Laureates.

show abstract

Section: Production and Operations Managementmentioning

confidence: 99%

Nobel laureates’ contributions to and impacts on operations management

Sethi

Gupta

Agrawal

et al. 2022

Production and Operations Management

View full text Add to dashboard Cite

show abstract

“…Table I shows runtime and network traffic of our protocol KEP-IP and the protocol KEP-RND-SS from [5], which is a more efficient implementation of the protocol from [6]. For both protocols, we consider a maximum cycle size l = 3 as this is the most common maximum cycle size used in existing kidney exchange platforms [2], [4]. The results for our protocol KEP-IP are averaged over 50 repetitions for each value of ι (number of patient-donor pairs).…”

Section: B Runtime Evaluationmentioning

confidence: 99%

“…These exchanges are usually carried out in exchange cycles where the donor of a patient-donor pair always donates to the patient of the succeeding pair in the cycle and the patient of a pair receives a kidney donation from the donor of the preceding pair. In practice, the maximum size of these exchange cycles is commonly restricted to two or three due to the amount of medical resources that are required to carry out a transplant [2].…”

Section: Introductionmentioning

confidence: 99%

“…In many countries, there are already central platforms that facilitate the solving of the KEP for registered incompatible patient-donor pairs [2], [4]. The drawbacks of this centralized approach are that these platforms possess the medical data of all registered patient-donor pairs and that they exhibit complete control over the computation of the possible exchanges.…”

Section: Introductionmentioning

confidence: 99%

“…Furthermore, the output also includes the structure of the Branch-and-Bound tree corresponding to the pruning decisions of the Branch-and-Bound algorithm. 2 Contributions. Our paper provides the following three main contributions: First, we devise an efficient SMPC protocol for solving the KEP for an arbitrary maximum cycle size l based on the Branch-and-Bound algorithm and prove its security (Section IV).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Solving the Kidney Exchange Problem Using Privacy-Preserving Integer Programming

Malte

Hein

Pompe

et al. 2022

2022 19th Annual International Conference on Privacy, Security &Amp; Trust (PST)

View full text Add to dashboard Cite

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 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 computed exchanges. However, the proposed approaches either do not provide the same functionality as the conventional solutions to the KEP or they come along with a huge performance impact. In this paper, we provide a novel privacy-preserving protocol for the KEP which significantly outperforms the existing approaches by allowing a small information leakage. This leakage allows us to base our protocol on Integer Programming which is the most efficient method for solving the KEP in the non privacypreserving case. We implement our protocol in the SMPC benchmarking framework MP-SPDZ and compare its performance to the existing protocols for solving the KEP.

show abstract

Kidney Exchange: An Operations Perspective

Cited by 2 publications

References 94 publications

Nobel laureates’ contributions to and impacts on operations management

Nobel laureates’ contributions to and impacts on operations management

Solving the Kidney Exchange Problem Using Privacy-Preserving Integer Programming

Contact Info

Product

Resources

About