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, i.e. by using cycles among no more than 3 patient-donor pairs. However, as kidney exchange has grown in practice, cycles among...

We introduce limited liability in a model with a continuum of ex ante identical agents who face aggregate and idiosyncratic income risk. These agents can trade a complete menu of contingent claims, but they cannot commit and shares in a Lucas tree serve as collateral to back up their...

In connection with an earlier paper on the exchange of live donor kidneys (Roth, Sonmez, and Unver 2004) the authors entered into discussions with New England transplant surgeons and their colleagues in the transplant community, aimed at implementing a Kidney Exchange program. In the course of...

For an incompatible patient-donor pair, kidney exchanges often forbid receipt-before-donation (the patient receives a kidney before the donor donates) and donation-before-receipt, causing a double-coincidence-of-wants problem. Our proposed algorithm, the Unpaired kidney exchange algorithm, uses...