Go to:
Logótipo
Você está em: Start > Publications > View > Fairness models for multi-agent kidney exchange programmes *
Publication

Fairness models for multi-agent kidney exchange programmes *

Title
Fairness models for multi-agent kidney exchange programmes *
Type
Article in International Scientific Journal
Year
2021
Authors
Klimentova, X
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Viana, A
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Joao Pedro Pedroso
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
Santos, N
(Author)
Other
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
Journal
Title: OmegaImported from Authenticus Search for Journal Publications
Vol. 102
ISSN: 0305-0483
Publisher: Elsevier
Other information
Authenticus ID: P-00S-QZX
Abstract (EN): Nowadays there are several countries running independent kidney exchange programmes (KEPs). These programmes allow a patient with kidney failure, having a willing healthy but incompatible donor, to receive a transplant from a similar pair where the donor is compatible with him. Since in general larger patient-donor pools allow for more patients to be matched, this prompts independent programmes (agents) to merge their pools and collaborate in order to increase the overall number of transplants. Such collaboration does however raise a problem: how to assign transplants to agents so that there is a balance between the contribution each agent brings to the merged pool and the benefit it gets from the collaboration. In this paper we propose a new Integer Programming model for multi-agent kidney exchange programmes (mKEPs). It considers the possible existence of multiple optimal solutions in each matching period of a KEP and, in consecutive matching periods, selects the optimal solution among the set of alternative ones in such a way that in the long-term the benefit each agent gets from participating in the mKEP is balanced accordingly to a given criterion. This is done by use of a memory mechanism. Extensive computational tests show the benefit of mKEPs, when compared to independent KEPs, in terms of potential increase in the number of transplants. Furthermore, they show that, under different policies, the number of additional transplants each agent receives can vary significantly. More importantly, results show that the proposed methodology consistently obtains more stable results than methodologies that do not use memory.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 14
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same journal

The two-dimensional knapsack problem with splittable items in stacks (2022)
Article in International Scientific Journal
Rapine, C; Joao Pedro Pedroso; Akbalik, A
The Floating-Cuts model: a general and flexible mixed-integer programming model for non-guillotine and guillotine rectangular cutting problems (2023)
Article in International Scientific Journal
Silva, E; José Fernando Oliveira; Silveira, T; Mundim, L; Maria Antónia Carravilla
The convergence of the World Health Organization Member States regarding the United Nations' Sustainable Development Goal 'Good health and well-being' (2021)
Article in International Scientific Journal
Pereira, MA; Ana Maria Cunha Ribeiro dos Santos Ponces Camanho; Marques, RC; Figueira, JR
Tactical production and distribution planning with dependency issues on the production process (2017)
Article in International Scientific Journal
Wenchao Wei; Luis Guimarães; Pedro Amorim; Bernardo Almada Lobo
Solving a large multi-product production-routing problem with delivery time windows (2019)
Article in International Scientific Journal
Fábio Neves Moreira; Bernardo Almada Lobo; Luís Guimarães; Jean-François Cordeau; Raf Jans

See all (19)

Recommend this page Top
Copyright 1996-2024 © Faculdade de Arquitectura da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z  I Guest Book
Page created on: 2024-10-06 at 19:23:39 | Acceptable Use Policy | Data Protection Policy | Complaint Portal