From offline to online kidney exchange optimization
dc.contributor.author | Chisca, Danuta Sorina | |
dc.contributor.author | Lombardi, Michele | |
dc.contributor.author | Milano, Michela | |
dc.contributor.author | O'Sullivan, Barry | |
dc.contributor.funder | Science Foundation Ireland | en |
dc.date.accessioned | 2019-02-18T19:13:40Z | |
dc.date.available | 2019-02-18T19:13:40Z | |
dc.date.issued | 2018-12-17 | |
dc.date.updated | 2019-02-18T18:29:14Z | |
dc.description.abstract | Kidney exchange programs enable willing, but incompatible, donor-patient pairs to swap donors, thus allowing persons suffering from organ failure to access transplantation. Choosing which pairs to match requires solving a stochastic online optimization problem where patients and donors arrive over time. Despite this, most of the related scientific literature has focused on deterministic offline models. In this paper, we present a simple approach to employ a model for the offline Kidney Exchange Problem (KEP) as the basis of an on-line anticipatory algorithm. Our approach grounds on existing techniques for the on-line KEP, but it generalizes them and provides a more accurate estimate of the expected impact of current decisions. In an experimentation based on a state-of-the-art donor pool generation method, the approach provides improvements in terms of quality and is able to deal with realistic instance size in reasonable time. | en |
dc.description.status | Not peer reviewed | en |
dc.description.uri | http://ictai2018.org/ | en |
dc.description.version | Accepted Version | en |
dc.format.mimetype | application/pdf | en |
dc.identifier.citation | Chisca, D. S., Lombardi, M., Milano, M. and O'Sullivan, B. (2018) 'From offline to online kidney exchange optimization', 30th International Conference on Tools with Artificial Intelligence (ICTAI), Volos, Greece, 5-7 November. doi:10.1109/ICTAI.2018.00095 | en |
dc.identifier.doi | 10.1109/ICTAI.2018.00095 | |
dc.identifier.endpage | 591 | en |
dc.identifier.isbn | 978-1-5386-7449-9 | |
dc.identifier.issn | 1082-3409 | |
dc.identifier.issn | 2375-0197 | |
dc.identifier.issn | 978-1-5386-7450-5 | |
dc.identifier.startpage | 587 | en |
dc.identifier.uri | https://hdl.handle.net/10468/7515 | |
dc.language.iso | en | en |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en |
dc.relation.ispartof | 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI) | |
dc.relation.project | info:eu-repo/grantAgreement/SFI/SFI Research Centres/12/RC/2289/IE/INSIGHT - Irelands Big Data and Analytics Research Centre/ | en |
dc.relation.uri | https://ieeexplore.ieee.org/abstract/document/8576093 | |
dc.rights | © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., | en |
dc.subject | Decision making | en |
dc.subject | Kidney | en |
dc.subject | Optimisation | en |
dc.subject | Patient diagnosis | en |
dc.subject | Stochastic processes | en |
dc.subject | Surgery | en |
dc.subject | Kidney exchange programs | en |
dc.subject | Donor-patient pairs | en |
dc.subject | Organ failure | en |
dc.subject | Stochastic online optimization problem | en |
dc.subject | On-line anticipatory algorithm | en |
dc.subject | Transplantation | en |
dc.subject | Online kidney exchange optimization | en |
dc.subject | Offline kidney exchange problem | en |
dc.subject | Donor pool generation | en |
dc.subject | Optimization | en |
dc.subject | Scalability | en |
dc.subject | Mathematical model | en |
dc.subject | Approximation algorithms | en |
dc.subject | Conferences | en |
dc.subject | Anticipatory algorithm | en |
dc.subject | Online stochastic kidney exchange | en |
dc.title | From offline to online kidney exchange optimization | en |
dc.type | Conference item | en |