{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T10:11:40Z","timestamp":1778753500508,"version":"3.51.4"},"reference-count":55,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T00:00:00Z","timestamp":1767830400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/X01357X\/1"],"award-info":[{"award-number":["EP\/X01357X\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003825","name":"Magyar Tudom\u00e1nyos Akad\u00e9mia","doi-asserted-by":"publisher","award":["C2258525"],"award-info":[{"award-number":["C2258525"]}],"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":["LP2021-2"],"award-info":[{"award-number":["LP2021-2"]}],"id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003827","name":"Nemzeti Kutatasi Fejlesztesi es Innovacios Hivatal","doi-asserted-by":"publisher","award":["K143858"],"award-info":[{"award-number":["K143858"]}],"id":[{"id":"10.13039\/501100003827","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003827","name":"Nemzeti Kutatasi Fejlesztesi es Innovacios Hivatal","doi-asserted-by":"publisher","award":["K138945"],"award-info":[{"award-number":["K138945"]}],"id":[{"id":"10.13039\/501100003827","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015269","name":"Innov\u00e1ci\u00f3s \u00e9s Technol\u00f3giai Miniszt\u00e9rium","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100015269","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","award":["RF-2022-607"],"award-info":[{"award-number":["RF-2022-607"]}],"id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011019","name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011019","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003549","name":"Hungarian Scientific Research Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012550","name":"Nemzeti Kutat\u00e1si, Fejleszt\u00e9si \u00e9s Innovaci\u00f3s Alap","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012550","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ejor.2025.12.046","type":"journal-article","created":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T07:57:21Z","timestamp":1767945441000},"page":"567-586","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing balanced solutions for large international kidney exchange schemes when cycle length is unbounded"],"prefix":"10.1016","volume":"333","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7492-1174","authenticated-orcid":false,"given":"M\u00e1rton","family":"Benedek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7011-3463","authenticated-orcid":false,"given":"P\u00e9ter","family":"Bir\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3811-4332","authenticated-orcid":false,"given":"Gergely","family":"Cs\u00e1ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7295-2663","authenticated-orcid":false,"given":"Matthew","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5945-9287","authenticated-orcid":false,"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6274-7092","authenticated-orcid":false,"given":"Xin","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2025.12.046_bib0001","series-title":"Proceedings EC 2007","first-page":"295","article-title":"Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges","author":"Abraham","year":"2007"},{"key":"10.1016\/j.ejor.2025.12.046_bib0002","doi-asserted-by":"crossref","first-page":"4026","DOI":"10.1257\/aer.20180771","article-title":"Market failure in kidney exchange","volume":"109","author":"Agarwal","year":"2019","journal-title":"American Economic Review"},{"key":"10.1016\/j.ejor.2025.12.046_bib0003","first-page":"338","article-title":"Organizing time exchanges: Lessons from matching markets","volume":"13","author":"Andersson","year":"2021","journal-title":"American Economic Journal: Microeconomics"},{"key":"10.1016\/j.ejor.2025.12.046_bib0004","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.geb.2013.05.008","article-title":"Mix and match: A strategyproof mechanism for multi-hospital kidney exchange","volume":"91","author":"Ashlagi","year":"2015","journal-title":"Games and Economic Behavior"},{"key":"10.1016\/j.ejor.2025.12.046_bib0005","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1257\/aer.102.3.354","article-title":"New challenges in multihospital kidney exchange","volume":"102","author":"Ashlagi","year":"2012","journal-title":"American Economic Review"},{"key":"10.1016\/j.ejor.2025.12.046_bib0006","doi-asserted-by":"crossref","first-page":"817","DOI":"10.3982\/TE1357","article-title":"Free riding and participation in large scale, multi-hospital kidney exchange","volume":"9","author":"Ashlagi","year":"2014","journal-title":"Theoretical Economics"},{"key":"10.1016\/j.ejor.2025.12.046_bib0007","series-title":"Proceedings AAAI 2021","first-page":"21","article-title":"Optimal kidney exchange with immunosuppressants","author":"Aziz","year":"2021"},{"key":"10.1016\/j.ejor.2025.12.046_bib0008","first-page":"317","article-title":"Weighted voting doesn\u2019t work: A mathematical analysis","volume":"19","author":"Banzhaf","year":"1964","journal-title":"Rutgers Law Review"},{"key":"10.1016\/j.ejor.2025.12.046_bib0009","article-title":"Operational research approaches and mathematical models for kidney exchange: A literature survey and empirical evaluation","volume":"to appear","author":"Barkel","year":"2025","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.046_bib0010","unstructured":"Benedek, M. (2021). International kidney exchange scheme. https:\/\/github.com\/blrzsvrzs\/int_kidney_exchange."},{"key":"10.1016\/j.ejor.2025.12.046_bib0011","series-title":"Proceedings AAMAS 2024","first-page":"2153","article-title":"Computing balanced solutions for large international kidney exchange schemes when cycle length is unbounded","author":"Benedek","year":"2024"},{"key":"10.1016\/j.ejor.2025.12.046_bib0012","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1613\/jair.1.14281","article-title":"The complexity of matching games: A survey","volume":"77","author":"Benedek","year":"2023","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/j.ejor.2025.12.046_bib0013","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1007\/s10107-025-02200-9","article-title":"Partitioned matching games for international kidney exchange","volume":"214","author":"Benedek","year":"2025","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2025.12.046_bib0014","series-title":"Proceedings AAMAS 2022","first-page":"82","article-title":"Computing balanced solutions for large international kidney exchange schemes","author":"Benedek","year":"2022"},{"key":"10.1016\/j.ejor.2025.12.046_bib0015","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/s10458-024-09645-w","article-title":"Computing balanced solutions for large international kidney exchange schemes","volume":"38","author":"Benedek","year":"2024","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"10.1016\/j.ejor.2025.12.046_bib0016","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10107-020-01527-9","article-title":"Finding and verifying the nucleolus of cooperative games","volume":"190","author":"Benedek","year":"2021","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2025.12.046_bib0017","series-title":"Proceedings ECMS 2020","first-page":"129","article-title":"Compensation scheme with Shapley value for multi-country kidney exchange programmes","author":"Bir\u00f3","year":"2020"},{"key":"10.1016\/j.ejor.2025.12.046_bib0018","doi-asserted-by":"crossref","first-page":"1514","DOI":"10.1097\/TP.0000000000002432","article-title":"Building kidney exchange programmes in Europe \u2013 an overview of exchange practice and activities","volume":"103","author":"Bir\u00f3","year":"2019","journal-title":"Transplantation"},{"key":"10.1016\/j.ejor.2025.12.046_bib0019","doi-asserted-by":"crossref","first-page":"1938","DOI":"10.1287\/moor.2022.0092","article-title":"Shapley-scarf housing markets: Respecting improvement, integer programming, and kidney exchange","volume":"49","author":"Bir\u00f3","year":"2024","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.046_bib0020","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/j.ejor.2019.09.006","article-title":"Modelling and optimisation in European kidney exchange programmes","volume":"291","author":"Bir\u00f3","year":"2021","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.046_bib0021","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1142\/S1793830909000373","article-title":"Maximum weight cycle packing in directed graphs, with application to kidney exchange programs","volume":"1","author":"Bir\u00f3","year":"2009","journal-title":"Discrete Mathematics, Algorithms and Applications"},{"key":"10.1016\/j.ejor.2025.12.046_bib0022","series-title":"Proceedings SODA 2017","first-page":"2351","article-title":"Opting into optimal matchings","author":"Blum","year":"2017"},{"key":"10.1016\/j.ejor.2025.12.046_bib0023","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1111\/tri.12945","article-title":"Czech-Austrian kidney paired donation: First European cross-border living donor kidney exchange","volume":"30","author":"B\u00f6hmig","year":"2017","journal-title":"Transplant International"},{"key":"10.1016\/j.ejor.2025.12.046_bib0024","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.ejor.2022.05.027","article-title":"A theoretical and computational equilibria analysis of a multi-player kidney exchange program","volume":"305","author":"Carvalho","year":"2023","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.046_bib0025","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10107-016-1013-7","article-title":"Nash equilibria in the two-player kidney exchange game","volume":"161","author":"Carvalho","year":"2017","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2025.12.046_bib0026","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ejor.2013.05.025","article-title":"New insights on integer-programming models for the kidney exchange problem","volume":"231","author":"Constantino","year":"2013","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.046_bib0027","first-page":"323","article-title":"Assignment games and permutation games","volume":"54","author":"Curiel","year":"1986","journal-title":"Methods of Operations Research"},{"key":"10.1016\/j.ejor.2025.12.046_bib0028","doi-asserted-by":"crossref","first-page":"1654","DOI":"10.1287\/opre.2022.2374","article-title":"New algorithms for hierarchical optimisation in kidney exchange programmes","volume":"72","author":"Delorme","year":"2024","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2025.12.046_bib0029","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105707","article-title":"Improved instance generation for kidney exchange programmes","volume":"141","author":"Delorme","year":"2022","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.046_bib0030","series-title":"Proceedings WGT@ETAPS, electronic notes in theoretical computer science","first-page":"23","article-title":"LEMON - An open source C++ graph template library","volume":"264","author":"Dezso","year":"2010"},{"key":"10.1016\/j.ejor.2025.12.046_bib0031","series-title":"Proceedings of EC 2016","first-page":"25","article-title":"Position-indexed formulations for kidney exchange","author":"Dickerson","year":"2016"},{"issue":"6","key":"10.1016\/j.ejor.2025.12.046_bib0032","doi-asserted-by":"crossref","first-page":"1660","DOI":"10.1287\/opre.2021.2107","article-title":"Compressing over-the-counter markets","volume":"69","author":"D\u2019Errico","year":"2021","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2025.12.046_bib0033","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canadian Journal of Mathematics"},{"key":"10.1016\/j.ejor.2025.12.046_bib0034","series-title":"Proceedings MFCS 2012, lecture notes in computer science","first-page":"478","article-title":"Planarizing gadgets for perfect matching do not exist","volume":"7464","author":"Gurjar","year":"2012"},{"key":"10.1016\/j.ejor.2025.12.046_bib0035","series-title":"Proceedings AAAI 2015","first-page":"921","article-title":"Strategy-proof and efficient kidney exchange using a credit mechanism","author":"Hajaj","year":"2015"},{"key":"10.1016\/j.ejor.2025.12.046_bib0036","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0166-218X(96)00062-5","article-title":"On the complexity of comparing evolutionary trees","volume":"71","author":"Hein","year":"1996","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2025.12.046_bib0037","doi-asserted-by":"crossref","first-page":"EBO","DOI":"10.4137\/EBO.S419","article-title":"SPR distance computation for unrooted trees","volume":"4","author":"Hickey","year":"2008","journal-title":"Evolutionary Bioinformatics"},{"key":"10.1016\/j.ejor.2025.12.046_bib0038","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2020.102333","article-title":"Fairness models for multi-agent kidney exchange programmes","volume":"102","author":"Klimentova","year":"2021","journal-title":"Omega"},{"key":"10.1016\/j.ejor.2025.12.046_bib0039","doi-asserted-by":"crossref","DOI":"10.1016\/j.jet.2021.105197","article-title":"Strategy-proof exchange under trichotomous preferences","volume":"193","author":"Manjunath","year":"2021","journal-title":"Journal of Economic Theory"},{"key":"10.1016\/j.ejor.2025.12.046_bib0040","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1287\/moor.4.4.303","article-title":"Geometric properties of the kernel, nucleolus, and related solution concepts","volume":"4","author":"Maschler","year":"1979","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/j.ejor.2025.12.046_bib0041","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1145\/322307.322309","article-title":"The complexity of restricted spanning tree problems","volume":"29","author":"Papadimitriou","year":"1982","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.ejor.2025.12.046_bib0042","series-title":"Game theory: A Multi-leveled approach","author":"Peters","year":"2008"},{"key":"10.1016\/j.ejor.2025.12.046_bib0043","unstructured":"Pettersson, W., & Trimble, J. (2021). Kidney matching tools data set generator. https:\/\/wpettersson.github.io\/kidney-webapp\/#\/generator."},{"key":"10.1016\/j.ejor.2025.12.046_bib0044","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1162\/0033553041382157","article-title":"Kidney exchange","volume":"119","author":"Roth","year":"2004","journal-title":"Quarterly Journal of Economics"},{"key":"10.1016\/j.ejor.2025.12.046_bib0045","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.jet.2005.04.004","article-title":"Pairwise kidney exchange","volume":"125","author":"Roth","year":"2005","journal-title":"Journal of Economic Theory"},{"key":"10.1016\/j.ejor.2025.12.046_bib0046","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1137\/0117107","article-title":"The nucleolus of a characteristic function game","volume":"17","author":"Schmeidler","year":"1969","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"10.1016\/j.ejor.2025.12.046_bib0047","first-page":"307","article-title":"A value for n-person games","volume":"28","author":"Shapley","year":"1953","journal-title":"Annals of Mathematical Studies"},{"key":"10.1016\/j.ejor.2025.12.046_bib0048","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10107-021-01748-6","article-title":"Identifying optimal strategies in kidney exchange games is \u03c32p-complete","volume":"203","author":"Smeulders","year":"2024","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2025.12.046_bib0049","series-title":"Proceedings IJCAI 2021","first-page":"419","article-title":"Fair pairwise exchange among groups","author":"Sun","year":"2021"},{"key":"10.1016\/j.ejor.2025.12.046_bib0050","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF01721088","article-title":"Permutation games: Another class of totally balanced games","volume":"6","author":"Tijs","year":"1984","journal-title":"OR Spektrum"},{"key":"10.1016\/j.ejor.2025.12.046_bib0051","unstructured":"Tijs, S. H. (1981). Bounds for the core of a game and the t-value. In O. Moeschlin & D. Pallaschke (Eds.), Gametheory and mathematical economics. North-Holland, Amsterdam, (pp. 123\u2013132)."},{"key":"10.1016\/j.ejor.2025.12.046_bib0052","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.geb.2015.01.001","article-title":"Design and analysis of multi-hospital kidney exchange mechanisms using random graphs","volume":"91","author":"Toulis","year":"2015","journal-title":"Games and Economic Behavior"},{"key":"10.1016\/j.ejor.2025.12.046_bib0053","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1097\/TP.0000000000002664","article-title":"International cooperation for kidney exchange success","volume":"103","author":"Valent\u00edn","year":"2019","journal-title":"Transplantation"},{"key":"10.1016\/j.ejor.2025.12.046_bib0054","unstructured":"Ye, X. (2023). International kidney exchange data. https:\/\/github.com\/Arya1531\/international_kidney_exchange_program\/tree\/main."},{"key":"10.1016\/j.ejor.2025.12.046_bib0055","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01769885","article-title":"Monotonic solutions of cooperative games","volume":"14","author":"Young","year":"1985","journal-title":"International Journal of Game Theory"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725010136?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725010136?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T09:18:15Z","timestamp":1778750295000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221725010136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["S0377221725010136"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.12.046","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Computing balanced solutions for large international kidney exchange schemes when cycle length is unbounded","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2025.12.046","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}