Most algorithmic matches in fielded kidney exchanges do not result in an actual transplant.
In this paper, we address the problem of cycles and chains in a proposed match failing after …

As multi‐hospital kidney exchange has grown, the set of players has grown from patients
and surgeons to include hospitals. Hospitals can choose to enroll only their hard‐to‐match …

Kidney exchange, where needy patients swap incompatible donors with each other, offers a
lifesaving alternative to waiting for an organ from the deceased-donor waiting list. Recently …

In many dynamic matching applications—especially high-stakes ones—the competitive
ratios of prior-free online algorithms are unacceptably poor. The algorithm should take …

Kidney exchange provides a life-saving alternative to long waiting lists for patients in need of
a new kidney. Fielded exchanges typically match under utilitarian or near-utilitarian rules; …

We study the computational problem of identifying optimal sets of kidney exchanges in the
UK. We show how to expand an integer programming-based formulation due to Roth et …

A main aim of kidney exchange programs (KEPs) is to maximize the number of transplants
within a pool of incompatible patient-donor pairs by exchanging donors. A KEP involving …

As kidney exchange programs are growing, manipulation by hospitals becomes more of an
issue. Assuming that hospitals wish to maximize the number of their own patients who …

It has been previously shown that for sufficiently large pools of patient-donor pairs,(almost)
efficient kidney exchange can be achieved by using at most 3-way cycles, ie by using cycles …

We study the computational problem of identifying optimal sets of kidney exchanges in the
UK. We show how to expand an integer programming-based formulation [1, 19] in order to …