Department of Economics2024-11-0920140304-406810.1016/j.jmateco.2013.09.0072-s2.0-84898049794https://hdl.handle.net/20.500.14288/529There is a set of incompatible patient-donor pairs and these pairs are matched pairwise. A match between two pairs corresponds to a paired kidney donation, where pairs exchange donated kidneys, or a paired listed exchange, where the first donor donates a kidney to the deceased donor wait-list, the first patient receives the kidney of the second donor, and the second patient receives a priority on the wait-list. We characterize the set of exchanges with the maximum number of transplants from the set of pairs. This characterization generalizes the well-known Gallai-Edmonds Decomposition Theorem.pdfEconomicsJournal Articlehttps://doi.org/10.1016/j.jmateco.2013.09.007334977500018Q3NOIR01079