The NTU Partitioned Matching Game for International Kidney Exchange Programs

References

• [1] Agarwal N, Ashlagi I, Azevedo E, Featherstone CR, Karaduman Ö (2019) Market failure in kidney exchange. Amer. Econom. Rev. 109(11):4026–4070.Crossref, Google Scholar
• [2] Aldershof B, Carducci OM (1996) Stable matchings with couples. Discrete Appl. Math. 68(1–2):203–207.Crossref, Google Scholar
• [3] Ashlagi I, Roth A (2011) Individual rationality and participation in large scale, multi-hospital kidney exchange. Proc. 12th ACM Conf. Electronic Commerce (Association for Computing Machinery, New York), 321–322.Google Scholar
• [4] Ashlagi I, Roth AE (2012) New challenges in multihospital kidney exchange. Amer. Econom. Rev. 102(3):354–359.Crossref, Google Scholar
• [5] Ashlagi I, Roth AE (2014) Free riding and participation in large scale, multi-hospital kidney exchange. Theoret. Econom. 9(3):817–863.Crossref, Google Scholar
• [6] Ashlagi I, Fischer F, Kash IA, Procaccia AD (2015) Mix and match: A strategyproof mechanism for multi-hospital kidney exchange. Games Econom. Behav. 91:284–296. Crossref, Google Scholar
• [7] Benedek M, Biró P, Paulusma D, Ye X (2024) Computing balanced solutions for large international kidney exchange schemes. Autonomous Agents and Multi-Agent Systems 38:18.Google Scholar
• [8] Benedek M, Biró P, Kern W, Pálvölgyi D, Paulusma D (2025) Partitioned matching games for international kidney exchange. Math. Programming 214:723–758.Crossref, Google Scholar
• [9] Benedek M, Biró P, Csáji G, Johnson M, Paulusma D, Ye X (2023) Computing balanced solutions for large international kidney exchange schemes when cycle length is unbounded. Preprint, submitted December 27, https://arxiv.org/abs/2312.16653.Google Scholar
• [10] Benedek M, Biró P, Csáji G, Johnson M, Paulusma D, Ye X (2024) Computing balanced solutions for large international kidney exchange schemes when cycle length is unbounded. Alechina N, Dignum V, Dastani M, Sichman JS, eds. Proc. 23rd Internat. Conf. Autonomous Agents Multiagent Systems (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC), 2153–2155.Google Scholar
• [11] Biró P, Csáji G (2024) Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains. Games Econom. Behav. 145:217–238.Crossref, Google Scholar
• [12] Biró P, Fleiner T (2016) Fractional solutions for capacitated NTU-games, with applications to stable matchings. Discrete Optim. 22(Part A):241–254.Crossref, Google Scholar
• [13] Biró P, Fleiner T, Irving RW (2016) Matching couples with Scarf’s algorithm. Ann. Math. Artificial Intelligence 77:303–316.Crossref, Google Scholar
• [14] Biró P, Kern W, Paulusma D, Wojuteczky P (2018) The stable fixtures problem with payments. Games Econom. Behav. 108:245–268.Crossref, Google Scholar
• [15] Biró P, Haase-Kromwijk B, Andersson T, Ásgeirsson EI, Baltesová T, Boletis I, Bolotinha C, et al. (2019) Building kidney exchange programmes in Europe—An overview of exchange practice and activities. Transplantation 103(7):1514–1522.Crossref, Google Scholar
• [16] Biró P, Van de Klundert J, Manlove D, Pettersson W, Andersson T, Burnapp L, Chromy P, et al. (2021) Modelling and optimisation in European kidney exchange programmes. Eur. J. Oper. Res. 291(2):447–456.Crossref, Google Scholar
• [17] Blair C (1988) The lattice structure of the set of stable matchings with multiple partners. Math. Oper. Res. 13(4):619–628.Link, Google Scholar
• [18] Blom D, Smeulders B, Spieksma FC (2022) Rejection-proof kidney exchange mechanisms. Preprint, submitted June 23, https://arxiv.org/abs/2206.11525.Google Scholar
• [19] Blum N (1990) A new approach to maximum matching in general graphs. Paterson MS, ed. Automata Languages Programming (ICALP 1990) (Springer, Berlin), 586–597.Google Scholar
• [20] Böhmig GA, Fronek J, Slavcev A, Fischer GF, Berlakovich G, Viklicky O (2017) Czech-Austrian kidney paired donation: First European cross-border living donor kidney exchange. Transplant Internat. 30(6):638–639.Crossref, Google Scholar
• [21] Carvalho M, Lodi A (2023) A theoretical and computational equilibria analysis of a multi-player kidney exchange program. Eur. J. Oper. Res. 305(1):373–385.Crossref, Google Scholar
• [22] Carvalho M, Lodi A, Pedroso JP, Viana A (2017) Nash equilibria in the two-player kidney exchange game. Math. Programming 161:389–417.Crossref, Google Scholar
• [23] Collette R (2023) Weak core solution for the non-transferable utility kidney exchange game. Master’s thesis, Université de Montréal, Montreal.Google Scholar
• [24] Csáji G, Manlove D, McBride I, Trimble J (2023) Couples can be tractable: New algorithms and hardness results for the hospitals/residents problem with couples. Preprint, submitted November 1, https://arxiv.org/abs/2311.00405.Google Scholar
• [25] Druzsin K, Biró P, Klimentova X, Fleiner R (2024) Performance evaluation of national and international kidney exchange programmes with the ENCKEP simulator. Central Eur. J. Oper. Res. 32(4):923–943.Google Scholar
• [26] Gale D, Shapley LS (1962) College admissions and the stability of marriage. Amer. Math. Monthly 69(1):9–15.Crossref, Google Scholar
• [27] Gourves L, Monnot J, Pascual F (2008) Cooperation in multiorganization matching. Bampis E, Skutella M, eds. Internat. Workshop Approximation Online Algorithms (Springer, Berlin), 78–91.Google Scholar
• [28] Hajaj C, Dickerson J, Hassidim A, Sandholm T, Sarne D (2015) Strategy-proof and efficient kidney exchange using a credit mechanism. Proc. AAAI Conf. Artificial Intelligence 29(1):921–928.Google Scholar
• [29] Irving RW (1985) An efficient algorithm for the “stable roommates” problem. J. Algorithms 6(4):577–595.Crossref, Google Scholar
• [30] Jankó Z (2018) Personal communication in email, September 20.Google Scholar
• [31] Kaneko M (1982) The central assignment game and the assignment markets. J. Math. Econom. 10(2–3):205–232.Crossref, Google Scholar
• [32] Kern W, Biró P, Pálvölgyi D, Paulusma D (2019) Generalized matching games for international kidney exchange. Proc. 18th Internat. Conf. Autonomous Agents Multiagent Systems (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC), 413–421.Google Scholar
• [33] Király T, Mészáros-Karkus Z (2020) Complexity of the NTU international matching game. Technical Report TR-2019-12, Egerváry Research Group, Budapest.Google Scholar
• [34] Klaus B, Klijn F (2005) Stable matchings and preferences of couples. J. Econom. Theory 121(1):75–106.Crossref, Google Scholar
• [35] Klimentova X, Viana A, Pedroso JP, Santos N (2021) Fairness models for multi-agent kidney exchange programmes. Omega 102:102333. Crossref, Google Scholar
• [36] Marx D, Schlotter I (2011) Stable assignment with couples: Parameterized complexity and local search. Discrete Optim. 8(1):25–40.Crossref, Google Scholar
• [37] McBride I, Manlove DF (2013) The hospitals/resident problem with couples: Complexity and integer programming models. Preprint, submitted August 21, https://arxiv.org/abs/1308.4534v1.Google Scholar
• [38] Nguyen T, Vohra R (2018) Near-feasible stable matchings with couples. Amer. Econom. Rev. 108(11):3154–3169.Crossref, Google Scholar
• [39] Ronn E (1990) NP-complete stable matching problems. J. Algorithms 11(2):285–304.Crossref, Google Scholar
• [40] Roth AE (1984) Stability and polarization of interests in job matching. Econometrica 52(1):47–58.Crossref, Google Scholar
• [41] Roth AE, Sönmez T, Ünver MU (2005) Pairwise kidney exchange. J. Econom. Theory 125(2):151–188.Crossref, Google Scholar
• [42] Roth AE, Sönmez T, Unver MU (2005) Transplant center incentives in kidney exchange. Unpublished note, Harvard University, Cambridge, MA, and Koç University, Istanbul.Google Scholar
• [43] Roth AE, Sönmez T, Ünver MU, Delmonico FL, Saidman SL (2006) Utilizing list exchange and nondirected donation through ‘chain’ paired kidney donations. Amer. J. Transplantation 6(11):2694–2705.Crossref, Google Scholar
• [44] Saidman SL, Roth AE, Sönmez T, Ünver MU, Delmonico FL (2006) Increasing the opportunity of live kidney donation by matching for two- and three-way exchanges. Transplantation 81(5):773–782.Crossref, Google Scholar
• [45] Scarf HE (1967) The core of an N person game. Econometrica 35(1):50–69.Crossref, Google Scholar
• [46] Shapley LS, Shubik M (1971) The assignment game I: The core. Internat. J. Game Theory 1(1):111–130.Crossref, Google Scholar
• [47] Sönmez T, Ünver MU (2013) Market design for kidney exchange. Vulkan N, Roth AE, Neeman Z, eds. The Handbook of Market Design (Oxford University Press, Oxford, UK), 93–137.Crossref, Google Scholar
• [48] Sotomayor M (1992) The multiple partners game. Majumdar M, ed. Equilibrium and Dynamics: Essays in Honour of David Gale (Springer, London), 322–354.Crossref, Google Scholar
• [49] Sotomayor M (1999) Three remarks on the many-to-many stable matching problem. Math. Soc. Sci. 38(1):55–70.Crossref, Google Scholar
• [50] Valentín MO, Garcia M, Costa AN, Bolotinha C, Guirado L, Vistoli F, Breda A, Fiaschetti P, Dominguez-Gil B (2019) International cooperation for kidney exchange success. Transplantation 103(6):e180–e181.Crossref, Google Scholar
• [51] Williamson M, Eirinakis P, Subramani K (2016) Fast algorithms for the undirected negative cost cycle detection problem. Algorithmica 74(1):270–325.Crossref, Google Scholar