Fair Pairwise Exchange among Groups

Zhaohong Sun, Taiki Todo, Toby Walsh

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

1 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルProceedings of the 30th International Joint Conference on Artificial Intelligence, IJCAI 2021
編集者Zhi-Hua Zhou
出版社International Joint Conferences on Artificial Intelligence
ページ419-425
ページ数7
ISBN(電子版)9780999241196
出版ステータス出版済み - 2021
イベント30th International Joint Conference on Artificial Intelligence, IJCAI 2021 - Virtual, Online, カナダ
継続期間: 8月 19 20218月 27 2021

出版物シリーズ

名前IJCAI International Joint Conference on Artificial Intelligence
ISSN(印刷版)1045-0823

会議

会議30th International Joint Conference on Artificial Intelligence, IJCAI 2021
国/地域カナダ
CityVirtual, Online
Period8/19/218/27/21

!!!All Science Journal Classification (ASJC) codes

  • 人工知能

フィンガープリント

「Fair Pairwise Exchange among Groups」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル