{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:25:46Z","timestamp":1772119546753,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T00:00:00Z","timestamp":1715817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T00:00:00Z","timestamp":1715817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100018818","name":"National Research, Development and Innovation Office","doi-asserted-by":"publisher","award":["K138945"],"award-info":[{"award-number":["K138945"]}],"id":[{"id":"10.13039\/501100018818","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018818","name":"National Research, Development and Innovation Office","doi-asserted-by":"publisher","award":["K143858"],"award-info":[{"award-number":["K143858"]}],"id":[{"id":"10.13039\/501100018818","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\/100018253","name":"Corvinus University of Budapest","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100018253","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    To overcome incompatibility issues, kidney patients may swap their donors. In international kidney exchange programmes (IKEPs), countries merge their national patient\u2013donor pools. We consider a recently introduced credit system. In each round, countries are given an initial \u201cfair\u201d allocation of the total number of kidney transplants. This allocation is adjusted by a credit function yielding a target allocation. The goal is to find a solution that approaches the target allocation as closely as possible, to ensure long-term stability of the international pool. As solutions, we use maximum matchings that lexicographically minimize the country deviations from the target allocation. We perform, for the first time, a computational study for a\n                    <jats:italic>large<\/jats:italic>\n                    number of countries. For the initial allocations we use two easy-to-compute solution concepts, the benefit value and the contribution value, and four classical but hard-to-compute concepts, the Shapley value, nucleolus, Banzhaf value and tau value. By using state-of-the-art software we show that the latter four concepts are now within reach for IKEPs of up to fifteen countries. Our experiments show that using lexicographically minimal maximum matchings instead of ones that only minimize the largest deviation from the target allocation (as previously done) may make an IKEP up to 54% more balanced.\n                  <\/jats:p>","DOI":"10.1007\/s10458-024-09645-w","type":"journal-article","created":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T04:02:31Z","timestamp":1715832151000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Computing balanced solutions for large international kidney exchange schemes"],"prefix":"10.1007","volume":"38","author":[{"given":"M\u00e1rton","family":"Benedek","sequence":"first","affiliation":[]},{"given":"P\u00e9ter","family":"Bir\u00f3","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Paulusma","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Ye","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,16]]},"reference":[{"key":"9645_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, D., Blum, A., & Sandholm, T. (2007). Clearing algorithms for Barter exchange markets: Enabling nationwide kidney exchanges. In Proc. EC (Vol. 2007, pp. 295\u2013304).","DOI":"10.1145\/1250910.1250954"},{"key":"9645_CR2","doi-asserted-by":"publisher","first-page":"4026","DOI":"10.1257\/aer.20180771","volume":"109","author":"N Agarwal","year":"2019","unstructured":"Agarwal, N., Ashlagi, I., Azevedo, E., Featherstone, C. R., & Karaduman, \u00d6. (2019). Market failure in kidney exchange. American Economic Review, 109, 4026\u20134070.","journal-title":"American Economic Review"},{"key":"9645_CR3","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1093\/restud\/rdz018","volume":"87","author":"T Andersson","year":"2020","unstructured":"Andersson, T., & Kratz, J. (2020). Pairwise kidney exchange over the blood group barrier. Review of Economic Studies, 87, 1091\u20131133.","journal-title":"Review of Economic Studies"},{"key":"9645_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, I., & Procaccia, A. (2015). Mix and match: A strategy proof mechanism for multi-hospital kidney exchange. Games and Economic Behavior, 91, 284\u2013296.","journal-title":"Games and Economic Behavior"},{"key":"9645_CR5","doi-asserted-by":"publisher","first-page":"35","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. American Economic Review, 102, 35\u2013359.","journal-title":"American Economic Review"},{"key":"9645_CR6","doi-asserted-by":"publisher","first-page":"817","DOI":"10.3982\/TE1357","volume":"9","author":"I Ashlagi","year":"2014","unstructured":"Ashlagi, I., & Roth, A. (2014). Free riding and participation in large scale, multi-hospital kidney exchange. Theoretical Economics, 9, 817\u2013863.","journal-title":"Theoretical Economics"},{"key":"9645_CR7","first-page":"317","volume":"19","author":"JF Banzhaf III","year":"1964","unstructured":"Banzhaf, J. F., III. (1964). Weighted voting doesn\u2019t work: A mathematical analysis. Rutgers Law Review, 19, 317\u2013343.","journal-title":"Rutgers Law Review"},{"key":"9645_CR8","unstructured":"Benedek, M. (2018). Nucleolus. https:\/\/github.com\/blrzsvrzs\/nucleolus"},{"key":"9645_CR9","unstructured":"Benedek, M. (2021). International Kidney exchange scheme. https:\/\/github.com\/blrzsvrzs\/int_kidney_exchange"},{"key":"9645_CR10","unstructured":"Benedek, M., Bir\u00f3, P., Kern, W., P\u00e1lv\u00f6lgyi, D., & Paulusma, D. (2023). Partitioned matching games for international kidney exchange. Preprint at arXiv:2301.13181"},{"key":"9645_CR11","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1613\/jair.1.14281","volume":"77","author":"M Benedek","year":"2023","unstructured":"Benedek, M., Bir\u00f3, P., Johnson, M., Paulusma, D., & Ye, X. (2023). The complexity of matching games: A survey. Journal of Artificial Intelligence Research, 77, 459\u2013485.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9645_CR12","doi-asserted-by":"crossref","unstructured":"Benedek, M., Bir\u00f3, P., Kern, W., & Paulusma, D. (2022). Computing balanced solutions for large international kidney exchange schemes. In Proc. AAMAS (Vol. 2022, pp. 82\u201390).","DOI":"10.21203\/rs.3.rs-2621065\/v1"},{"key":"9645_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10107-020-01527-9","volume":"190","author":"M Benedek","year":"2021","unstructured":"Benedek, M., Fliege, J., & Nguyen, T. D. (2021). Finding and verifying the nucleolus of cooperative games. Mathematical Programming, 190, 135\u2013170.","journal-title":"Mathematical Programming"},{"key":"9645_CR14","doi-asserted-by":"publisher","first-page":"1514","DOI":"10.1097\/TP.0000000000002432","volume":"103","author":"P Bir\u00f3","year":"2019","unstructured":"Bir\u00f3, P., Haase, B., van de Klundert, J., et al. (2019). Building kidney exchange programmes in Europe: An overview of exchange practice and activities. Transplantation, 103, 1514\u20131522.","journal-title":"Transplantation"},{"key":"9645_CR15","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.ejor.2019.09.006","volume":"291","author":"P Bir\u00f3","year":"2021","unstructured":"Bir\u00f3, P., van de Klundert, J., Manlove, D. F., et al. (2021). Modelling and optimisation in European kidney exchange programmes. European Journal of Operational Research, 291, 447\u2013456.","journal-title":"European Journal of Operational Research"},{"key":"9645_CR16","doi-asserted-by":"crossref","unstructured":"Bir\u00f3, P., Gyetvai, M., Klimentova, X., Pedroso, J. P., Pettersson, W., & Viana, A. (2020). Compensation scheme with Shapley value for multi-country kidney exchange programmes. In: Proc. ECMS (Vol. 2020, pp. 129\u2013136).","DOI":"10.7148\/2020-0129"},{"key":"9645_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00182-011-0273-y","volume":"41","author":"P Bir\u00f3","year":"2012","unstructured":"Bir\u00f3, P., Kern, W., & Paulusma, D. (2012). Computing solutions for matching games. International Journal of Game Theory, 41, 75\u201390.","journal-title":"International Journal of Game Theory"},{"key":"9645_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.geb.2017.02.002","volume":"108","author":"P Bir\u00f3","year":"2018","unstructured":"Bir\u00f3, P., Kern, W., Paulusma, D., & Wojuteczky, P. (2018). The stable fixture problem with payments. Games and Economic Behaviour, 108, 245\u2013268.","journal-title":"Games and Economic Behaviour"},{"key":"9645_CR19","unstructured":"Bir\u00f3, P., Kern, W., P\u00e1lv\u00f6lgyi, D., & Paulusma, D. (2019). Generalized matching games for international kidney exchange. In: Proc. AAMAS vol. 2019, pp. 413\u2013421."},{"key":"9645_CR20","doi-asserted-by":"crossref","unstructured":"Blum, A., Caragiannis, I., Haghtalab, N., Procaccia, A. D., Procaccia, E. B., & Vaish, R. (2017). Opting into optimal matchings. In: Proc. SODA (Vol. 2017, pp. 2351\u20132363).","DOI":"10.1137\/1.9781611974782.155"},{"key":"9645_CR21","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1287\/opre.2019.1856","volume":"68","author":"A Blum","year":"2020","unstructured":"Blum, A., Dickerson, J. P., Haghtalab, N., Procaccia, A. D., Sandholm, T., & Sharma, A. (2020). Ignorance is almost bliss: Near-optimal stochastic matching with few queries. Operations Research, 68, 16\u201334.","journal-title":"Operations Research"},{"key":"9645_CR22","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1111\/tri.12945","volume":"30","author":"GA B\u00f6hmig","year":"2017","unstructured":"B\u00f6hmig, G. A., Fronek, J., Slavcev, A., Fischer, G. F., Berlakovich, G., & Viklicky, O. (2017). Czech-Austrian kidney paired donation: First European cross-border living donor kidney exchange. Transplant International, 30, 638\u2013639.","journal-title":"Transplant International"},{"key":"9645_CR23","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, J. P., & Viana, A. (2017). Nash equilibria in the two-player kidney exchange game. Mathematical Programming, 161, 389\u2013417.","journal-title":"Mathematical Programming"},{"key":"9645_CR24","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.ejor.2022.05.027","volume":"305","author":"M Carvalho","year":"2023","unstructured":"Carvalho, M., & Lodi, A. (2023). A theoretical and computational equilibria analysis of a multi-player kidney exchange program. European Journal of Operational Research, 305, 373\u2013385.","journal-title":"European Journal of Operational Research"},{"key":"9645_CR25","unstructured":"Delorme, M., Garc\u0131a, S., Gondzio, J., Kalcsics, J., Manlove, D. F., & Petterson, W. New algorithms for hierarchical optimisation in kidney exchange programmes. Operations Research, to appear."},{"key":"9645_CR26","doi-asserted-by":"publisher","first-page":"105707","DOI":"10.1016\/j.cor.2022.105707","volume":"141","author":"M Delorme","year":"2022","unstructured":"Delorme, M., Garcia, S., Gondzio, J., Kalcsics, J., Manlove, D. F., Pettersson, W., & Trimble, J. (2022). Improved instance generation for kidney exchange programmes. Computers & Operations Research, 141, 105707.","journal-title":"Computers & Operations Research"},{"key":"9645_CR27","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1287\/moor.24.3.751","volume":"24","author":"X Deng","year":"1999","unstructured":"Deng, X., Ibaraki, T., & Nagamochi, H. (1999). Algorithmic aspects of the core of combinatorial optimization games. Mathematics of Operations Research, 24, 751\u2013766.","journal-title":"Mathematics of Operations Research"},{"key":"9645_CR28","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.entcs.2011.06.003","volume":"264","author":"B Dezs\u0151","year":"2011","unstructured":"Dezs\u0151, B., J\u00fcttner, A., & Kov\u00e1cs, P. (2011). LEMON-an open source C++ graph template library. Electronic Notes in Theoretical Computer Science, 264, 23\u201345.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"9645_CR29","doi-asserted-by":"crossref","unstructured":"Dickerson, J. P., Kazachkov, A. M., Procaccia, A. D., & Sandholm, T. (2017). Small representations of big kidney exchange graphs. Proc. AAAI (Vol. 2017, pp. 487\u2013493).","DOI":"10.1609\/aaai.v31i1.10593"},{"key":"9645_CR30","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J. (1965). Maximum matching and a polyhedron with $$0,1$$-vertices. Journal of Research of the National Bureau of Standards Section B, 69B, 125\u2013130.","journal-title":"Journal of Research of the National Bureau of Standards Section B"},{"key":"9645_CR31","doi-asserted-by":"crossref","unstructured":"Gately D. (1974). Sharing the gains from regional cooperation: A game theoretic application to planning investment in electric power. International Economic Review, 195\u2013208.","DOI":"10.2307\/2526099"},{"key":"9645_CR32","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 Proc. AAAI (vol. 2015, pp. 921\u2013928).","DOI":"10.1609\/aaai.v29i1.9322"},{"key":"9645_CR33","unstructured":"Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y., & Okamoto, Y. (2016). Efficient stabilization of cooperative matching games. Proc. AAMAS (Vol. 2016, pp. 41\u201349)."},{"key":"9645_CR34","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1287\/moor.28.2.294.14477","volume":"28","author":"W Kern","year":"2003","unstructured":"Kern, W., & Paulusma, D. (2003). Matching games: The least core and the nucleolus. Mathematics of Operations Research, 28, 294\u2013308.","journal-title":"Mathematics of Operations Research"},{"key":"9645_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2016.03.004","volume":"73","author":"X Klimentova","year":"2016","unstructured":"Klimentova, X., Pedroso, J. P., & Viana, A. (2016). Maximising expectation of the number of transplants in kidney exchange programmes. Computers & Operations Research, 73, 1\u201311.","journal-title":"Computers & Operations Research"},{"key":"9645_CR36","doi-asserted-by":"publisher","first-page":"102333","DOI":"10.1016\/j.omega.2020.102333","volume":"102","author":"X Klimentova","year":"2021","unstructured":"Klimentova, X., Viana, A., Pedroso, J. P., & Santos, N. (2021). Fairness models for multi-agent kidney exchange programmes. Omega, 102, 102333.","journal-title":"Omega"},{"key":"9645_CR37","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10107-020-01483-4","volume":"183","author":"J K\u00f6nemann","year":"2020","unstructured":"K\u00f6nemann, J., Pashkovich, K., & Toth, J. (2020). Computing the nucleolus of weighted cooperative matching games in polynomial time. Mathematical Programming, 183, 555\u2013581.","journal-title":"Mathematical Programming"},{"issue":"2","key":"9645_CR38","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10100-020-00706-5","volume":"29","author":"RS Mincu","year":"2021","unstructured":"Mincu, R. S., Bir\u00f3, P., Gyetvai, M., Popa, A., & Verma, U. (2021). IP solutions for international kidney exchange programmes. Central European Journal of Operations Research, 29(2), 403\u2013423.","journal-title":"Central European Journal of Operations Research"},{"key":"9645_CR39","unstructured":"Pettersson, W., & Trimble, J. (2021). Kidney matching tools data set generator. https:\/\/wpettersson.github.io\/kidney-webapp\/#\/generator."},{"key":"9645_CR40","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1057\/s41274-016-0174-3","volume":"68","author":"N Santos","year":"2017","unstructured":"Santos, N., Tubertini, P., Viana, A., & Pedroso, J. P. (2017). Kidney exchange simulation and optimization. Journal of the Operational Research Society, 68, 1521\u20131532.","journal-title":"Journal of the Operational Research Society"},{"key":"9645_CR41","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/0117107","volume":"17","author":"D Schmeidler","year":"1969","unstructured":"Schmeidler, D. (1969). The nucleolus of a characteristic function game. SIAM Journal on Applied Mathematics, 17, 1163\u20131170.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"9645_CR42","first-page":"307","volume":"II","author":"L Shapley","year":"1953","unstructured":"Shapley, L. (1953). A value for $$n$$-person games. Contributions to the Theory of Games, II, 307\u2013317.","journal-title":"Contributions to the Theory of Games"},{"key":"9645_CR43","unstructured":"Staudacher, J., & Anwander, J. (2019). Conditions for the uniqueness of the Gately point for cooperative games. Preprint at arXiv:1901.01485."},{"key":"9645_CR44","doi-asserted-by":"crossref","unstructured":"Sun, Z., Todo, T., & Walsh, T. (2021). Fair pairwise exchange among groups. In: Proc. IJCAI (vol. 2021, pp. 419\u2013425).","DOI":"10.24963\/ijcai.2021\/59"},{"key":"9645_CR45","unstructured":"Tijs, S. (1981). Bounds for the core of a game and the t-value. Game Theory and Mathematical Economics, 123\u2013132."},{"key":"9645_CR46","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, D. (2015). Design and analysis of multi-hospital kidney exchange mechanisms using random graphs. Games and Economic Behavior, 91, 360\u2013382.","journal-title":"Games and Economic Behavior"},{"key":"9645_CR47","unstructured":"Trimble, J. (2016). GitHub repository, Kidney Matching Tools Data Set Generator. https:\/\/jamestrimble.github.io\/kidney-webapp\/#\/generator."},{"key":"9645_CR48","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1097\/TP.0000000000002664","volume":"103","author":"MO Valent\u00edn","year":"2019","unstructured":"Valent\u00edn, M. O., Garcia, M., Costa, A. N., Bolotinha, C., Guirado, L., Vistoli, F., Breda, A., Fiaschetti, P., & Dominguez-Gil, B. (2019). International cooperation for kidney exchange success. Transplantation, 103, 180\u2013181.","journal-title":"Transplantation"},{"key":"9645_CR49","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s003550050125","volume":"15","author":"R van den Brink","year":"1998","unstructured":"van den Brink, R., & van der Laan, G. (1998). Axiomatizations of the normalized Banzhaf value and the Shapley value. Social Choice and Welfare, 15, 567\u2013582.","journal-title":"Social Choice and Welfare"},{"key":"9645_CR50","first-page":"421","volume":"3","author":"EB Yanovskaya","year":"2010","unstructured":"Yanovskaya, E. B. (2010). The nucleolus and the $$\\tau$$-value of interval games. Contributions to Game Theory and Management, 3, 421\u2013430.","journal-title":"Contributions to Game Theory and Management"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-024-09645-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-024-09645-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-024-09645-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T19:06:25Z","timestamp":1719860785000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-024-09645-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,16]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["9645"],"URL":"https:\/\/doi.org\/10.1007\/s10458-024-09645-w","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2621065\/v1","asserted-by":"object"}]},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,16]]},"assertion":[{"value":"14 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Only synthetic data was used (not involving human or animal subjects).","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"18"}}