In kidney paired donation (KPD), incompatible donor-candidate pairs and non-directed (also known as altruistic) donors are pooled together with the aim of maximizing the total utility of transplants realized via donor exchanges. We consider a setting in which disjoint sets of potential transplants are selected at regular intervals, with fallback options available within each proposed set in the case of individual donor, candidate or match failure. We develop methods for calculating the expected utility for such sets under a realistic probability model for the KPD. Exact expected utility calculations for these sets are compared to estimates based on Monte Carlo samples of the underlying network. Models and methods are extended to include transplant candidates who join KPD with more than one incompatible donor. Microsimulations demonstrate the superiority of accounting for failure probability and fallback options, as well as candidates joining with additional donors, in terms of realized transplants and waiting time for candidates.
Keywords: Expected Utility; Fallback Options; Kidney Paired Donation; Network Analysis; Organ Exchanges; Waiting Time.