{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:53Z","timestamp":1740124013977,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10957-023-02211-6","type":"journal-article","created":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T10:02:34Z","timestamp":1683194554000},"page":"476-507","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Recourse Policy to Improve Number of Successful Transplants in Uncertain Kidney Exchange Programs"],"prefix":"10.1007","volume":"197","author":[{"given":"Mehdi","family":"Zeynivand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0751-7267","authenticated-orcid":false,"given":"Mehdi","family":"Najafi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Modarres","family":"Yazdi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,4]]},"reference":[{"key":"2211_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, D. J., Blum, A., Sandholm, T.: (2007). Clearing algorithms for barter exchange markets: Enabling nationwide kidney exchanges. In: Mackie-Mason, J. (ed.) Proceedings of the 8th ACM Conference on Electronic Commerce, 295\u2013304.","DOI":"10.1145\/1250910.1250954"},{"key":"2211_CR2","doi-asserted-by":"crossref","unstructured":"Akbarpour, M., Li, S., Gharan, S. O.: (2014). Dynamic matching market design. arXiv preprint arXiv:1402.3643.","DOI":"10.2139\/ssrn.2394319"},{"key":"2211_CR3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.jmsy.2013.11.004","volume":"33","author":"\u015e Akpinar","year":"2014","unstructured":"Akpinar, \u015e, Baykaso\u011flu, A.: Modeling and solving mixed-model assembly line balancing problem with setups. Part I: a mixed integer linear programming model. J. Manuf. Syst. 33, 177\u2013187 (2014)","journal-title":"J. Manuf. Syst."},{"key":"2211_CR4","first-page":"1","volume":"272","author":"F Alvelos","year":"2017","unstructured":"Alvelos, F., Klimentova, X., Viana, A.: Maximizing the expected number of transplants in kidney exchange programs with branch-and-price. Ann. Oper. Res. 272, 1\u201316 (2017)","journal-title":"Ann. Oper. Res."},{"key":"2211_CR5","unstructured":"Anderson, R. M. (2014). Stochastic models and data driven simulations for healthcare operations. Dissertation, Massachusetts Institute of Technology."},{"issue":"3","key":"2211_CR6","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1073\/pnas.1421853112","volume":"112","author":"R Anderson","year":"2015","unstructured":"Anderson, R., Ashlagi, I., Gamarnik, D., Roth, A.E.: Finding long chains in kidney exchange using the traveling salesman problem. Proc. Natl. Acad. Sci. 112(3), 663\u2013668 (2015)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"2211_CR7","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Gamarnik, D., Rees, M. A., Roth, A. E. (2012). The need for (long) chains in kidney exchange. Technical report, National Bureau of Economic Research, Cambridge, MA.","DOI":"10.3386\/w18202"},{"key":"2211_CR8","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1111\/j.1600-6143.2011.03481.x","volume":"11","author":"I Ashlagi","year":"2011","unstructured":"Ashlagi, I., Gilchrist, D.S., Roth, A.E., Rees, M.A.: Non-simultaneous chains and dominos in kidney-paired donation\u2014Revisited. Am. J. Transplant. 11, 984\u2013994 (2011)","journal-title":"Am. J. Transplant."},{"key":"2211_CR9","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Jaillet, P., Manshadi, V. H. (2013). Kidney exchange in dynamic sparse heterogenous pools. In: Kearns, M. (ed.) Proceedings of the 14th ACM Conference on Electronic Commerce, 25\u201326.","DOI":"10.1145\/2482540.2482565"},{"key":"2211_CR10","doi-asserted-by":"crossref","first-page":"5455","DOI":"10.1287\/mnsc.2020.3954","volume":"67","author":"I Ashlagi","year":"2021","unstructured":"Ashlagi, I., Roth, A.E.: Kidney exchange: An operations perspective. Manage. Sci. 67, 5455\u20135478 (2021)","journal-title":"Manage. Sci."},{"issue":"3","key":"2211_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3355903","volume":"7","author":"S Assadi","year":"2019","unstructured":"Assadi, S., Khanna, S., Li, Y.: The stochastic matching problem with (very) few queries. ACM Trans. Econ. Comput. (TEAC) 7(3), 1\u201319 (2019)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"issue":"7","key":"2211_CR12","doi-asserted-by":"crossref","first-page":"1514","DOI":"10.1097\/TP.0000000000002432","volume":"103","author":"P Bir\u00f3","year":"2019","unstructured":"Bir\u00f3, P., Haase-Kromwijk, B., Andersson, T., \u00c1sgeirsson, E.I., Baltesov\u00e1, T., Boletis, I., Bolotinha, C., Bond, G., B\u00f6hmig, G., Burnapp, L.: Building kidney exchange programmes in Europe\u2014an overview of exchange practice and activities. Transplantation 103(7), 1514\u20131522 (2019)","journal-title":"Transplantation"},{"key":"2211_CR13","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/j.ejor.2019.09.006","volume":"291","author":"P Bir\u00f3","year":"2019","unstructured":"Bir\u00f3, P., van de Klundert, J., Manlove, D., Pettersson, W., Andersson, T., Burnapp, L., Chromy, P., Delgado, P., Dworczak, P., Haase, B.: Modelling and optimisation in European Kidney Exchange Programmess. Eur. J. Oper. Res. 291, 447\u2013456 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2211_CR14","doi-asserted-by":"crossref","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.: Ignorance is almost bliss: Near-optimal stochastic matching with few queries. Oper. Res. 68(1), 16\u201334 (2020)","journal-title":"Oper. Res."},{"issue":"1","key":"2211_CR15","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s12561-018-9214-7","volume":"10","author":"M Bray","year":"2018","unstructured":"Bray, M., Wang, W., Song, P.X.-K., Kalbfleisch, J.D.: Valuing sets of potential transplants in a kidney paired donation network. Stat. Biosci. 10(1), 255\u2013279 (2018)","journal-title":"Stat. Biosci."},{"issue":"10","key":"2211_CR16","doi-asserted-by":"crossref","first-page":"2636","DOI":"10.1111\/ajt.13413","volume":"15","author":"M Bray","year":"2015","unstructured":"Bray, M., Wang, W., Song, P.K., Leichtman, A., Rees, M., Ashby, V., Eikstadt, R., Goulding, A., Kalbfleisch, J.: Planning for uncertainty and fallbacks can increase the number of transplants in a kidney-paired donation program. Am. J. Transplant. 15(10), 2636\u20132645 (2015)","journal-title":"Am. J. Transplant."},{"key":"2211_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-6940-7","volume-title":"Search methodologies: introductory tutorials in optimization and decision support techniques","author":"EK Burke","year":"2014","unstructured":"Burke, E.K., Kendall, G.: Search methodologies: introductory tutorials in optimization and decision support techniques. Springer (2014)"},{"issue":"9","key":"2211_CR18","doi-asserted-by":"crossref","first-page":"2180","DOI":"10.1111\/j.1600-6143.2009.02730.x","volume":"9","author":"FK Butt","year":"2009","unstructured":"Butt, F.K., Gritsch, H., Schulam, P., Danovitch, G., Wilkinson, A., Del Pizzo, J., Kapur, S., Serur, D., Katznelson, S., Busque, S.: Asynchronous, out-of-sequence, transcontinental chain kidney transplantation: A novel concept. Am. J. Transplant. 9(9), 2180\u20132185 (2009)","journal-title":"Am. J. Transplant."},{"issue":"5","key":"2211_CR19","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/inte.20.5.61","volume":"20","author":"JD Camm","year":"1990","unstructured":"Camm, J.D., Raturi, A.S., Tsubakitani, S.: Cutting big M down to size. Interfaces 20(5), 61\u201366 (1990)","journal-title":"Interfaces"},{"issue":"3","key":"2211_CR20","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1287\/ijoc.2020.0986","volume":"33","author":"M Carvalho","year":"2021","unstructured":"Carvalho, M., Klimentova, X., Glorie, K., Viana, A., Constantino, M.: Robust models for the kidney exchange problem. INFORMS J. Comput. 33(3), 861\u2013881 (2021)","journal-title":"INFORMS J. Comput."},{"issue":"7","key":"2211_CR21","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1109\/TBME.2012.2195663","volume":"59","author":"Y Chen","year":"2012","unstructured":"Chen, Y., Li, Y., Kalbfleisch, J.D., Zhou, Y., Leichtman, A., Song, P.X.-K.: Graph-based optimization algorithm and software on kidney exchanges. IEEE Trans. Biomed. Eng. 59(7), 1985\u20131991 (2012)","journal-title":"IEEE Trans. Biomed. Eng."},{"issue":"5","key":"2211_CR22","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1097\/TP.0000000000000455","volume":"99","author":"EH Cole","year":"2015","unstructured":"Cole, E.H., Nickerson, P., Campbell, P., Yetzer, K., Lahaie, N., Zaltzman, J., Gill, J.S.: The Canadian kidney paired donation program: a national program to increase living donor transplantation. Transplantation 99(5), 985\u2013990 (2015)","journal-title":"Transplantation"},{"issue":"1","key":"2211_CR23","doi-asserted-by":"crossref","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.: New insights on integer-programming models for the kidney exchange problem. Eur. J. Oper. Res. 231(1), 57\u201368 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"2211_CR24","first-page":"78","volume":"54","author":"M Delorme","year":"2022","unstructured":"Delorme, M., Garc\u00eda, S., Gondzio, J., Kalcsics, J., Manlove, D., Pettersson, W., Trimble, J.: Improved instance generation for kidney exchange programmes. Computers Op. Res. 54, 78 (2022)","journal-title":"Computers Op. Res."},{"issue":"4","key":"2211_CR25","doi-asserted-by":"crossref","first-page":"1768","DOI":"10.1287\/mnsc.2018.3026","volume":"65","author":"JP Dickerson","year":"2018","unstructured":"Dickerson, J.P., Procaccia, A.D., Sandholm, T.: Failure-aware kidney exchange. Manage. Sci. 65(4), 1768\u20131791 (2018)","journal-title":"Manage. Sci."},{"key":"2211_CR26","doi-asserted-by":"crossref","unstructured":"Dickerson, J. P., Sandholm, T. (2015). FutureMatch: Combining human value judgments and machine learning to match in dynamic environments. In: Bonet, B., Koenig, S. (eds) Proceedings of the AAAI Conference on Artificial Intelligence.","DOI":"10.1609\/aaai.v29i1.9239"},{"key":"2211_CR27","unstructured":"Gate, S. F. (2015). 9-way kidney swap involving 18 surgeries at 2 SF hospitals. https:\/\/www.sfgate.com\/health\/article\/9-way-kidney-swap-involving-18-surgeries-at-2-6307975.php."},{"issue":"1","key":"2211_CR28","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1053\/j.ajkd.2010.10.005","volume":"57","author":"SE Gentry","year":"2011","unstructured":"Gentry, S.E., Montgomery, R.A., Segev, D.L.: Kidney paired donation: Fundamentals, limitations, and expansions. Am. J. Kidney Dis. 57(1), 144\u2013151 (2011)","journal-title":"Am. J. Kidney Dis."},{"issue":"6","key":"2211_CR29","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1111\/j.1600-6143.2009.02622.x","volume":"9","author":"SE Gentry","year":"2009","unstructured":"Gentry, S.E., Montgomery, R.A., Swihart, B.J., Segev, D.L.: The roles of dominos and non-simultaneous chains in kidney paired donation. Am. J. Transplant. 9(6), 1330\u20131336 (2009)","journal-title":"Am. J. Transplant."},{"key":"2211_CR30","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.apm.2022.01.001","volume":"105","author":"N Ghandehari","year":"2022","unstructured":"Ghandehari, N., Kianfar, K.: Mixed-integer linear programming, constraint programming and column generation approaches for operating room planning under block strategy. Appl. Math. Model. 105, 438\u2013453 (2022)","journal-title":"Appl. Math. Model."},{"issue":"4","key":"2211_CR31","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/msom.2014.0496","volume":"16","author":"KM Glorie","year":"2014","unstructured":"Glorie, K.M., van de Klundert, J.J., Wagelmans, A.P.: Kidney exchange with long chains: an efficient pricing algorithm for clearing barter exchanges with branch-and-price. Manuf. Serv. Oper. Manag. 16(4), 498\u2013512 (2014)","journal-title":"Manuf. Serv. Oper. Manag."},{"issue":"1","key":"2211_CR32","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1097\/TP.0000000000003203","volume":"105","author":"M De Klerk","year":"2021","unstructured":"De Klerk, M., Kal-van Gestel, J.A., van de Wetering, J., Kho, M.L., Middel-de Sterke, S., Betjes, M.G., Zuidema, W.C., Roelen, D., Glorie, K., Roodnat, J.I.: Creating options for difficult-to-match kidney transplant candidates. Transplantation 105(1), 240\u2013248 (2021)","journal-title":"Transplantation"},{"issue":"9","key":"2211_CR33","doi-asserted-by":"crossref","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, K.M., Claas, F.H., Witvliet, M., Haase-Kromwijk, B.J., Weimar, W.: The Dutch national living donor kidney exchange program. Am. J. Transplant. 5(9), 2302\u20132305 (2005)","journal-title":"Am. J. Transplant."},{"key":"2211_CR34","doi-asserted-by":"crossref","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.: Maximising expectation of the number of transplants in kidney exchange programmes. Comput. Oper. Res. 73, 1\u201311 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"2211_CR35","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1111\/tri.13833","volume":"34","author":"VB Kute","year":"2021","unstructured":"Kute, V.B., Patel, H.V., Modi, P.R., Rizvi, S.J., Shah, P.R., Engineer, D.P., Banerjee, S., Meshram, H.S., Butala, B.P., Modi, M.P.: Non-simultaneous kidney exchange cycles in resource-restricted countries without non-directed donation\u2013a prospective single-center cohort study. Transpl. Int. 34(4), 669\u2013680 (2021)","journal-title":"Transpl. Int."},{"key":"2211_CR36","volume":"115","author":"E Lam","year":"2020","unstructured":"Lam, E., Mak-Hau, V.: Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange. Comput. Oper. Res. 115, 104852 (2020)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"2211_CR37","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s12561-013-9082-0","volume":"6","author":"Y Li","year":"2014","unstructured":"Li, Y., Song, P.X.-K., Zhou, Y., Leichtman, A.B., Rees, M.A., Kalbfleisch, J.D.: Optimal decisions for organ exchanges in a kidney paired donation program. Stat. Biosci. 6(1), 85\u2013104 (2014)","journal-title":"Stat. Biosci."},{"key":"2211_CR38","volume":"152","author":"Y Li","year":"2021","unstructured":"Li, Y., Xiang, T., Szeto, W.Y.: Home health care routing and scheduling problem with the consideration of outpatient services. Transp. Res. Part E: Logist. Transp. Rev. 152, 102420 (2021)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"3","key":"2211_CR39","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1023\/A:1021207331209","volume":"115","author":"Y Liu","year":"2002","unstructured":"Liu, Y., Passino, K.: Biomimicry of social foraging bacteria for distributed optimization: models, principles, and emergent behaviors. J. Optim. Theory Appl. 115(3), 603\u2013628 (2002)","journal-title":"J. Optim. Theory Appl."},{"key":"2211_CR40","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.cor.2018.06.008","volume":"99","author":"V Mak-Hau","year":"2018","unstructured":"Mak-Hau, V.: A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs. Comput. Oper. Res. 99, 13\u201326 (2018)","journal-title":"Comput. Oper. Res."},{"key":"2211_CR41","doi-asserted-by":"crossref","unstructured":"Manlove, D. F., O\u2019Malley, G. (2012). Paired and altruistic kidney donation in the UK: Algorithms and experimentation. In: Klasing, R. (ed.) Exprimental Algorithm. International Symposium on Experimental Algorithms.","DOI":"10.1007\/978-3-642-30850-5_24"},{"issue":"1","key":"2211_CR42","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/A:1014809314463","volume":"113","author":"J Park","year":"2002","unstructured":"Park, J.: Robust decentralized stabilization of uncertain large-scale discrete-time systems with delays. J. Optim. Theory Appl. 113(1), 105\u2013119 (2002)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2211_CR43","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1097\/00007890-199901270-00027","volume":"67","author":"K Park","year":"1999","unstructured":"Park, K., Moon, J.I., Kim, S.I., Kim, Y.S.: Exchange donor program in kidney transplantation1. Transplantation 67(2), 336\u2013338 (1999)","journal-title":"Transplantation"},{"key":"2211_CR44","doi-asserted-by":"crossref","unstructured":"Pedroso, J. P. (2014). Maximizing expectation on vertex-disjoint cycle packing. In: Murgante, B., Maria, A., Taniar, D. (eds) International Conference on Computational Science and Its Applications.","DOI":"10.1007\/978-3-319-09129-7_3"},{"issue":"3","key":"2211_CR45","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1007\/s10957-016-1014-y","volume":"172","author":"M Raap","year":"2017","unstructured":"Raap, M., Meyer-Nieberg, S., Pickl, S., Zsifkovits, M.: Aerial vehicle search-path optimization: a novel method for emergency operations. J. Optim. Theory Appl. 172(3), 965\u2013983 (2017)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2211_CR46","first-page":"5","volume":"18","author":"FT Rapaport","year":"1986","unstructured":"Rapaport, F.T.: The case for a living emotionally related international kidney donor exchange registry. Transpl. Proc. 18(3), 5\u20139 (1986)","journal-title":"Transpl. Proc."},{"key":"2211_CR47","doi-asserted-by":"crossref","first-page":"1752","DOI":"10.1056\/NEJM199706123362412","volume":"336","author":"LF Ross","year":"1997","unstructured":"Ross, L.F., Rubin, D.T., Siegler, M., Josephson, M.A., Thistlethwaite, J.R., Jr., Woodle, E.S.: Ethics of a paired-kidney-exchange program. N. Engl. J. Med. 336, 1752\u20131755 (1997)","journal-title":"N. Engl. J. Med."},{"issue":"8","key":"2211_CR48","doi-asserted-by":"crossref","first-page":"1539","DOI":"10.1097\/00007890-200004270-00001","volume":"69","author":"LF Ross","year":"2000","unstructured":"Ross, L.F., Woodle, E.S.: Ethical issues in increasing living kidney donations by expanding kidney paired exchange programs. Transplantation 69(8), 1539\u20131543 (2000)","journal-title":"Transplantation"},{"issue":"5","key":"2211_CR49","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1097\/01.TP.0000134522.31554.05","volume":"78","author":"LF Ross","year":"2004","unstructured":"Ross, L.F., Zenios, S.: Restricting living-donor\u2013cadaver-donor exchanges to ensure that standard blood type O wait-list candidates benefit. Transplantation 78(5), 641\u2013646 (2004)","journal-title":"Transplantation"},{"issue":"2","key":"2211_CR50","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1257\/000282805774669989","volume":"95","author":"AE Roth","year":"2005","unstructured":"Roth, A.E., S\u00f6nmez, T.: A kidney exchange clearinghouse in New England. American Econ. Rev. 95(2), 376\u2013380 (2005)","journal-title":"American Econ. Rev."},{"issue":"2","key":"2211_CR51","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1162\/0033553041382157","volume":"119","author":"AE Roth","year":"2004","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.U.: Kidney exchange. Q. J. Econ. 119(2), 457\u2013488 (2004)","journal-title":"Q. J. Econ."},{"issue":"3","key":"2211_CR52","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1257\/aer.97.3.828","volume":"97","author":"AE Roth","year":"2007","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.U.: Efficient kidney exchange: Coincidence of wants in markets with compatibility-based preferences. American Econ. Rev. 97(3), 828\u2013851 (2007)","journal-title":"American Econ. Rev."},{"issue":"5","key":"2211_CR53","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1097\/01.tp.0000195775.77081.25","volume":"81","author":"SL Saidman","year":"2006","unstructured":"Saidman, S.L., Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.U., Delmonico, F.L.: Increasing the opportunity of live kidney donation by matching for two-and three-way exchanges. Transplantation 81(5), 773\u2013782 (2006)","journal-title":"Transplantation"},{"key":"2211_CR54","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.geb.2015.01.001","volume":"91","author":"P Toulis","year":"2015","unstructured":"Toulis, P., Parkes, D.C.: Design and analysis of multi-hospital kidney exchange mechanisms using random graphs. Games Econom. Behav. 91, 360\u2013382 (2015)","journal-title":"Games Econom. Behav."},{"issue":"1","key":"2211_CR55","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1111\/j.1467-937X.2009.00575.x","volume":"77","author":"MU \u00dcnver","year":"2010","unstructured":"\u00dcnver, M.U.: Dynamic kidney exchange. Rev. Econ. Stud. 77(1), 372\u2013414 (2010)","journal-title":"Rev. Econ. Stud."},{"key":"2211_CR56","first-page":"45","volume":"20","author":"W Wang","year":"2019","unstructured":"Wang, W., Bray, M., Song, P.X., Kalbfleisch, J.D.: An efficient algorithm to enumerate sets with fallbacks in a kidney paired donation program. Op. Res. Health Care 20, 45\u201355 (2019)","journal-title":"Op. Res. Health Care"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02211-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-023-02211-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02211-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T13:13:09Z","timestamp":1684415589000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-023-02211-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":56,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["2211"],"URL":"https:\/\/doi.org\/10.1007\/s10957-023-02211-6","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2023,5]]},"assertion":[{"value":"21 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}