{"type":"ScholarlyArticle","title":"Exact Algorithms and Complexity of Kidney Exchange","authors":[{"name":"Mingyu Xiao","slug":"mingyu-xiao","given":"Mingyu","family":"Xiao","affiliation":"School of Computer Science and Engineering , University of Electronic Science and Technology of China , China"},{"name":"Xuanbei Wang","slug":"xuanbei-wang","given":"Xuanbei","family":"Wang","affiliation":"School of Computer Science and Engineering , University of Electronic Science and Technology of China , China"}],"abstract":"Kidney Exchange is an approach to donor kidney transplantation where patients with incompatible donors swap kidneys to receive a compatible kidney. Since it was first put forward in 1986, increasing amount of people have gotten a life-saving kidney with the popularity of Kidney Exchange, as patients have more opportunities to get saved in this way. This growth is making the problem of optimally matching patients to donors more difficult to solve. The central problem, indeed, is the NP-hard problem to find the largest vertex-disjoint packing of cycles and chains in a graph that represents the compatibility between patients and donors, where due to the human resource limitation we may have constraints on the maximum length of cycles and chains. This paper mainly contributes to algorithms from theory for this problem with and without length constraints (restricted and free versions). We give:\r\n1. A single-exponential exact algorithm based on subset convolution for the two versions;\r\n2. An FPT algorithm for the free version with parameter being the number of vertex ``types'' in the graph.","doi":"10.24963/ijcai.2018/77","url":"https://ijcai.org/proceedings/2018/77","pdf":"https://ijcai.org/proceedings/2018/0077.pdf","markdown":"https://ijcai.org/proceedings/2018/77.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/77","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":77,"pages":{"first":555,"last":561},"keywords":["Agent-based and Multi-agent Systems: Economic Paradigms, Auctions and Market-Based Systems","Multidisciplinary Topics and Applications: Computational Sustainability"],"videos":[],"references":[{"position":1,"raw":"[Abraham et al., 2007] David J Abraham, Avrim Blum, and Tuomas Sandholm. Clearing algorithms for barter ex- change markets: Enabling nationwide kidney exchanges. In Proceedings of the 8th ACM conference on Electronic commerce, pages 295-304. ACM, 2007.","title":"Clearing algorithms for barter exchange markets: Enabling nationwide kidney exchanges","authors":"Avrim David J Abraham, Tuomas Blum, Sandholm","year":"2007","venue":"Proceedings of the 8th ACM conference on Electronic commerce","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Anderson et al., 2015] Ross Anderson, Itai Ashlagi, David Gamarnik, and Alvin E Roth. Finding long chains in kidney exchange using the traveling salesman prob- lem. Proceedings of the National Academy of Sciences, 112(3):663-668, 2015.","title":"Finding long chains in kidney exchange using the traveling salesman problem","authors":"Ross Anderson, Itai Ashlagi, David Gamarnik, Alvin E Roth","year":"2015","venue":"Proceedings of the National Academy of Sciences","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Biro et al., 2009] Péter Biro, David F Manlove, and Romeo Rizzi. Maximum weight cycle packing in directed graphs, with application to kidney exchange programs. Discrete Mathematics, Algorithms and Applications, 1(04):499- 517, 2009.","title":"Maximum weight cycle packing in directed graphs, with application to kidney exchange programs","authors":"Péter Biro, David F Manlove, Romeo Rizzi","year":"2009","venue":"Discrete Mathematics, Algorithms and Applications","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Björklund et al., 2007] Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Fourier meets möbius: fast subset convolution. In Proceedings of the Annual Acm Symposium on Theory of Computing, pages 67-74, 2007.","title":"Fourier meets möbius: fast subset convolution","authors":"Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto","year":"2007","venue":"Proceedings of the Annual Acm Symposium on Theory of Computing","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Constantino et al., 2013] Miguel Constantino, Xenia Kli- mentova, Ana Viana, and Abdur Rais. New insights on integer-programming models for the kidney exchange problem. European Journal of Operational Research, 231(1):57-68, 2013.","title":"New insights on integer-programming models for the kidney exchange problem","authors":"Constantino","year":"2013","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Dadush, 2012] Daniel Nicolas Dadush. Integer Program- ming, Lattice Algorithms, and Deterministic Volume Es- timation. PhD thesis, Georgia Institute of Technology, Atlanta, GA, USA, 2012.","title":"Integer Programming, Lattice Algorithms, and Deterministic Volume Estimation","authors":"Nicolas Daniel, Dadush","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Dickerson et al., 2016] John P. Dickerson, David F. Manlove, Benjamin Plaut, Tuomas Sandholm, and James Trimble. Position-indexed formulations for kidney exchange. In ACM Conference on Economics and Computation, pages 25-42, 2016.","title":"Position-indexed formulations for kidney exchange","authors":"John P Dickerson, David F Manlove, Benjamin Plaut, Tuomas Sandholm, James Trimble","year":"2016","venue":"ACM Conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Dickerson et al., 2017] John P Dickerson, Aleksandr M Kazachkov, Ariel D Procaccia, and Tuomas Sandholm. Small representations of big kidney exchange graphs. In AAAI, pages 487-493, 2017.","title":"Small representations of big kidney exchange graphs","authors":"Aleksandr M John P Dickerson, Ariel D Kazachkov, Tuomas Procaccia, Sandholm","year":"2017","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Downey and Fellows, 2013] Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013.","title":"Fundamentals of Parameterized Complexity","authors":"Rodney G Downey, Michael R Fellows","year":"2013","venue":"Texts in Computer Science","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Glorie et al., 2014] Kristiaan M Glorie, J Joris van de Klun- dert, and Albert PM Wagelmans. Kidney exchange with long chains: An efficient pricing algorithm for clearing barter exchanges with branch-and-price. Manufacturing & Service Operations Management, 16(4):498-512, 2014.","title":"Kidney exchange with long chains: An efficient pricing algorithm for clearing barter exchanges with branch-and-price","authors":"J Kristiaan M Glorie, Albert Pm Joris Van De Klundert, Wagelmans","year":"2014","venue":"Manufacturing & Service Operations Management","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Gruessner and Sutherland, 2005] Angelika C Gruessner and David ER Sutherland. Pancreas transplant outcomes for united states (US) and non-us cases as reported to the united network for organ sharing (UNOS) and the international pancreas transplant registry (IPTR) as of june 2004. Clinical transplantation, 19(4):433-455, 2005.","title":"Pancreas transplant outcomes for united states (US) and non-us cases as reported to the united network for organ sharing (UNOS) and the international pancreas transplant registry (IPTR) as of june 2004","authors":"C Angelika, Gruessner, E R David, Sutherland","year":"2005","venue":"Clinical transplantation","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Jia et al., 2017] Zhipeng Jia, Pingzhong Tang, Ruosong Wang, and Hanrui Zhang. Efficient near-optimal algo- rithms for barter exchange. In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Sys- tems, AAMAS 2017, São Paulo, Brazil, May 8-12, 2017, pages 362-370, 2017.","title":"Efficient near-optimal algorithms for barter exchange","authors":"Zhipeng Jia, Pingzhong Tang, Ruosong Wang, Hanrui Zhang","year":"2017","venue":"Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2017","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Klimentova et al., 2014] Xenia Klimentova, Filipe Alvelos, and Ana Viana. A new branch-and-price approach for the kidney exchange problem. In International Conference on Computational Science and Its Applications, pages 237- 252. Springer, 2014.","title":"Ana Viana. A new branch-and-price approach for the kidney exchange problem","authors":"Klimentova","year":"2014","venue":"International Conference on Computational Science and Its Applications","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Krivelevich et al., 2007] Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Verstraete Yuster, and Raphael Yuster. Approximation algorithms and hard- ness results for cycle packing problems. ACM Transac- tions on Algorithms, 3(4):48, 2007.","title":"Approximation algorithms and hardness results for cycle packing problems","authors":"Michael Krivelevich, Zeev Nutov, Mohammad R Salavatipour, Jacques Verstraete Yuster, Raphael Yuster","year":"2007","venue":"ACM Transactions on Algorithms","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Li et al., 2014] Jian Li, Yicheng Liu, Lingxiao Huang, and Pingzhong Tang. Egalitarian pairwise kidney exchange: fast algorithms via linear programming and parametric flow. In International Conference on Autonomous Agents and Multi-Agent Systems, pages 445-452, 2014.","title":"Egalitarian pairwise kidney exchange: fast algorithms via linear programming and parametric flow","authors":"Jian Li, Yicheng Liu, Lingxiao Huang, Pingzhong Tang","year":"2014","venue":"International Conference on Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Mak-Hau, 2017] Vicky Mak-Hau. On the kidney exchange problem: cardinality constrained cycle and chain prob- lems on directed graphs: a survey of integer program- ming approaches. Journal of combinatorial optimization, 33(1):35-59, 2017.","title":"On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches","authors":"Vicky Mak-Hau","year":"2017","venue":"Journal of combinatorial optimization","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Manlove and O'Malley, 2012] David F. Manlove and Gregg O'Malley. Paired and altruistic kidney donation in the uk: Algorithms and experimentation. In Ralf Klasing, editor, Experimental Algorithms, pages 271-282, Berlin, Heidelberg, 2012. Springer Berlin Heidelberg.","title":"Paired and altruistic kidney donation in the uk: Algorithms and experimentation","authors":"David F Manlove, O' Gregg, Malley","year":"2012","venue":"Experimental Algorithms","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Manlove and O'Malley, 2014] David F. Manlove and Gregg O'Malley. Paired and altruistic kidney donation in the UK: algorithms and experimentation. ACM Journal of Experimental Algorithmics, 19(1), 2014.","title":"Paired and altruistic kidney donation in the UK: algorithms and experimentation","authors":"David F Manlove, O' Gregg, Malley","year":"2014","venue":"ACM Journal of Experimental Algorithmics","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[McConnell and de Montgolfier, 2005] Ross M. McConnell and Fabien de Montgolfier. Linear-time modular decom- position of directed graphs. Discrete Applied Mathematic- s, 145(2):198-209, 2005.","title":"Linear-time modular decomposition of directed graphs","authors":"Ross M Mcconnell, Fabien De Montgolfier","year":"2005","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Rapaport, 1986] F. T. Rapaport. The case for a living emotionally related international kidney donor exchange registry. Transplantation Proceedings, 18(2):5-9, 1986.","title":"The case for a living emotionally related international kidney donor exchange registry","authors":"F T Rapaport","year":"1986","venue":"Transplantation Proceedings","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Roth et al., 2005a] Alvin E. Roth, Tayfun Snmez, and M. Utku nver. A kidney exchange clearinghouse in new england. The American Economic Review, 95(2):376-380, 2005.","title":"A kidney exchange clearinghouse in new england","authors":"Roth","year":"2005","venue":"The American Economic Review","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Roth et al., 2005b] Alvin E. Roth, Tayfun Sönmez, and M. Utku Ünver. Pairwise kidney exchange. J. Economic Theory, 125(2):151-188, 2005.","title":"Pairwise kidney exchange","authors":"Roth","year":"2005","venue":"J. Economic Theory","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Segev et al., 2005] Dorry L Segev, Sommer E Gentry, Daniel S Warren, Brigitte Reeb, and Robert A Mont- gomery. Kidney paired donation and optimizing the use of live donor organs. JAMA, 293(15):1883-1890, 2005.","title":"Kidney paired donation and optimizing the use of live donor organs","authors":"Dorry L Segev, Sommer E Gentry, Brigitte Daniel S Warren, Robert A Reeb, Montgomery","year":"2005","venue":"JAMA","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Sönmez and Ünver, 2014] Tayfun Sönmez and M. Utku Ünver. Altruistically unbalanced kidney exchange. Jour- nal of Economic Theory, 152(1):105-129, 2014.","title":"Altruistically unbalanced kidney exchange","authors":"Tayfun Sönmez, M","year":"2014","venue":"Journal of Economic Theory","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}