Fair Pairwise Exchange among Groups
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. Main Track. Pages 419-425.
https://doi.org/10.24963/ijcai.2021/59
Keywords
- Agent-based and Multi-agent Systems: Economic Paradigms, Auctions and Market-Based Systems
Abstract
We study the pairwise organ exchange problem among groups motivated by real-world applications and consider two types of group formulations. Each
group represents either a certain type of patient-donor pairs who are compatible with the same set of organs, or a set of patient-donor pairs who reside
in the same region. We address a natural research question, which asks how to match a maximum number of pairwise compatible patient-donor
pairs in a fair and individually rational way. We first propose a natural fairness concept that is applicable to both types of group formulations and design
a polynomial-time algorithm that checks whether a matching exists that satisfies optimality, individual rationality, and fairness. We also present several
running time upper bounds for computing such matchings for different graph structures.
@inproceedings{ijcai2021p59,
title = {Fair Pairwise Exchange among Groups},
author = {Sun, Zhaohong and Todo, Taiki and Walsh, Toby},
booktitle = {Proceedings of the Thirtieth International Joint Conference on
Artificial Intelligence, {IJCAI-21}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Prof. Zhi-Hua Zhou},
pages = {419--425},
year = {2021},
month = {8},
note = {Main Track},
doi = {10.24963/ijcai.2021/59},
url = {https://doi.org/10.24963/ijcai.2021/59},
}
TY - CPAPER TI - Fair Pairwise Exchange among Groups AU - Sun, Zhaohong AU - Todo, Taiki AU - Walsh, Toby T2 - Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21 PB - International Joint Conferences on Artificial Intelligence Organization PY - 2021 SP - 419 EP - 425 DO - 10.24963/ijcai.2021/59 UR - https://doi.org/10.24963/ijcai.2021/59 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: