{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T04:40:54Z","timestamp":1772080854916,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T00:00:00Z","timestamp":1598832000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T00:00:00Z","timestamp":1598832000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003825","name":"Magyar Tudom\u00e1nyos Akad\u00e9mia","doi-asserted-by":"publisher","award":["LP2016-3\/2018"],"award-info":[{"award-number":["LP2016-3\/2018"]}],"id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003825","name":"Magyar Tudom\u00e1nyos Akad\u00e9mia","doi-asserted-by":"publisher","award":["KEP-6\/2018"],"award-info":[{"award-number":["KEP-6\/2018"]}],"id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003825","name":"Hungarian Science Foundation","doi-asserted-by":"publisher","award":["K129086"],"award-info":[{"award-number":["K129086"]}],"id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2021,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In kidney exchange programmes patients with end-stage renal failure may exchange their willing, but incompatible living donors among each other. National kidney exchange programmes are in operation in ten European countries, and some of them have already conducted international exchanges through regulated collaborations. The exchanges are selected by conducting regular matching runs (typically every three months) according to well-defined constraints and optimisation criteria, which may differ across countries. In this work we give integer programming formulations for solving international kidney exchange problems, where the optimisation goals and constraints may be different in the participating countries and various feasibility criteria may apply for the international cycles and chains. We also conduct simulations showing the long-run effects of international collaborations for different pools and under various national restrictions and objectives. We compute the expected gains of the cooperation between two countries with different pool sizes and different restrictions on the cycle-length. For instance, if country A allows 3-way cycles and country B allows 2-way cycles only, whilst the pool size of country A is four times larger than the pool size of country B (which is a realistic case for the relation of Spain and France, respectively), then the increase in the number of transplants will be about 2% for country A and about 37% for country B.<\/jats:p>","DOI":"10.1007\/s10100-020-00706-5","type":"journal-article","created":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T21:03:07Z","timestamp":1598907787000},"page":"403-423","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["IP solutions for international kidney exchange programmes"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2613-582X","authenticated-orcid":false,"given":"Radu-Stefan","family":"Mincu","sequence":"first","affiliation":[]},{"given":"P\u00e9ter","family":"Bir\u00f3","sequence":"additional","affiliation":[]},{"given":"M\u00e1rton","family":"Gyetvai","sequence":"additional","affiliation":[]},{"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[]},{"given":"Utkarsh","family":"Verma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,31]]},"reference":[{"key":"706_CR1","doi-asserted-by":"crossref","unstructured":"Abraham DJ, Blum A, Sandholm T (2007) Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. In: Proceedings on EC \u201907: the 8th ACM conference on electronic commerce. ACM, pp 295\u2013304","DOI":"10.1145\/1250910.1250954"},{"key":"706_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal N, Ashlagi I, Azevedo E, Featherstone CR, Karaduman \u00d6 (2018) Market failure in kidney exchange. Technical report, National Bureau of Economic Research","DOI":"10.3386\/w24775"},{"key":"706_CR3","unstructured":"Andersson T, Kratz J (2016) Pairwise kidney exchange over the blood group barrier. Lund University Department of Economics Working Paper, 2016, p 11"},{"issue":"Supplement C","key":"706_CR4","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.geb.2013.05.008","volume":"91","author":"I Ashlagi","year":"2015","unstructured":"Ashlagi I, Fischer F, Kash IA, Procaccia AD (2015) Mix and match: a strategyproof mechanism for multi-hospital kidney exchange. Games Econ Behav 91(Supplement C):284\u2013296","journal-title":"Games Econ Behav"},{"issue":"3","key":"706_CR5","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1257\/aer.102.3.354","volume":"102","author":"I Ashlagi","year":"2012","unstructured":"Ashlagi I, Roth A (2012) New challenges in multihospital kidney exchange. Am Econ Rev 102(3):354\u2013359","journal-title":"Am Econ Rev"},{"issue":"3","key":"706_CR6","doi-asserted-by":"publisher","first-page":"817","DOI":"10.3982\/TE1357","volume":"9","author":"I Ashlagi","year":"2014","unstructured":"Ashlagi I, Roth AE (2014) Free riding and participation in large scale, multi-hospital kidney exchange. Theor Econ 9(3):817\u2013863","journal-title":"Theor Econ"},{"key":"706_CR7","unstructured":"Bir\u00f3 P, Haase B et\u00a0al (2018) Building kidney exchange programmes in Europe\u2014an overview of exchange practice and activities. Transplantation (to appear)"},{"issue":"6","key":"706_CR8","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1111\/tri.12945","volume":"30","author":"GA B\u00f6hmig","year":"2017","unstructured":"B\u00f6hmig 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. Transpl Int 30(6):638\u2013639","journal-title":"Transpl Int"},{"issue":"1\u20132","key":"706_CR9","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10107-016-1013-7","volume":"161","author":"M Carvalho","year":"2017","unstructured":"Carvalho M, Lodi A, Pedroso JP, Viana A (2017) Nash equilibria in the two-player kidney exchange game. Math Program 161(1\u20132):389\u2013417","journal-title":"Math Program"},{"issue":"1","key":"706_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2013.05.025","volume":"231","author":"M Constantino","year":"2013","unstructured":"Constantino M, Klimentova X, Viana A, Rais A (2013) New insights on integer-programming models for the kidney exchange problem. Eur J Oper Res 231(1):57\u201368","journal-title":"Eur J Oper Res"},{"issue":"9","key":"706_CR11","doi-asserted-by":"publisher","first-page":"2302","DOI":"10.1111\/j.1600-6143.2005.01024.x","volume":"5","author":"M De Klerk","year":"2005","unstructured":"De Klerk M, Keizer KM, Claas FHJ, Witvliet M, Haase-Kromwijk B, Weimar W (2005) The Dutch national living donor kidney exchange program. Am J Transplant 5(9):2302\u20132305","journal-title":"Am J Transplant"},{"key":"706_CR12","doi-asserted-by":"crossref","unstructured":"Hajaj C, Dickerson J, Hassidim A, Sandholm T, Sarne D (2015) Strategy-proof and efficient kidney exchange using a credit mechanism. In: Proceedings of the twenty-ninth AAAI conference on artificial intelligence, pp 921\u2013928","DOI":"10.1609\/aaai.v29i1.9322"},{"key":"706_CR13","unstructured":"Klimentova X, Santos N, Pedroso JP, Viana A (2019) Fairness models for multi-agent kidney exchange programs. Working paper"},{"key":"706_CR14","doi-asserted-by":"crossref","unstructured":"Manlove DF, O\u2019Malley G (2014) Paired and altruistic kidney donation in the UK: algorithms and experimentation. ACM J Exp Algorithmics 19(2), article 2.6, 21pp","DOI":"10.1145\/2670129"},{"issue":"11","key":"706_CR15","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1056\/NEJMoa0803645","volume":"360","author":"MA Rees","year":"2009","unstructured":"Rees MA, Kopke JE, Pelletier RP, Segev DL, Rutter ME, Fabrega AJ, Rogers J, Pankewycz OG, Hiller J, Roth AE, Sandholm T, \u00dcnver MU, Montgomery RA (2009) A nonsimultaneous, extended, altruistic-donor chain. N Engl J Med 360(11):1096\u20131101","journal-title":"N Engl J Med"},{"key":"706_CR16","first-page":"1","volume":"12","author":"N Santos","year":"2017","unstructured":"Santos N, Tubertini P, Viana A, Pedroso JP (2017) Kidney exchange simulation and optimization. J Oper Res Soc 12:1\u201312","journal-title":"J Oper Res Soc"},{"issue":"Supplement C","key":"706_CR17","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.geb.2015.01.001","volume":"91","author":"P Toulis","year":"2015","unstructured":"Toulis P, Parkes DC (2015) Design and analysis of multi-hospital kidney exchange mechanisms using random graphs. Games Econ Behav 91(Supplement C):360\u2013382","journal-title":"Games Econ Behav"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-020-00706-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10100-020-00706-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-020-00706-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T00:12:47Z","timestamp":1668211967000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10100-020-00706-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,31]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["706"],"URL":"https:\/\/doi.org\/10.1007\/s10100-020-00706-5","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,31]]},"assertion":[{"value":"31 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}