{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T10:20:06Z","timestamp":1768990806979,"version":"3.49.0"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,8]]},"abstract":"<jats:p>We study the pairwise organ exchange problem among groups motivated by real-world applications and consider two types of group formulations. Each\n\ngroup 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\n\nin the same region. We address a natural research question, which asks how to match a maximum number of pairwise compatible patient-donor\n\npairs 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\n\na polynomial-time algorithm that checks whether a matching exists that satisfies optimality, individual rationality, and fairness. We also present several\n\nrunning time upper bounds for computing such matchings for different graph structures.<\/jats:p>","DOI":"10.24963\/ijcai.2021\/59","type":"proceedings-article","created":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T11:00:49Z","timestamp":1628679649000},"page":"419-425","source":"Crossref","is-referenced-by-count":4,"title":["Fair Pairwise Exchange among Groups"],"prefix":"10.24963","author":[{"given":"Zhaohong","family":"Sun","sequence":"first","affiliation":[{"name":"UNSW Sydney"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taiki","family":"Todo","sequence":"additional","affiliation":[{"name":"Kyushu University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[{"name":"UNSW Sydney"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"name":"Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}","theme":"Artificial Intelligence","location":"Montreal, Canada","acronym":"IJCAI-2021","number":"30","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"start":{"date-parts":[[2021,8,19]]},"end":{"date-parts":[[2021,8,27]]}},"container-title":["Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T11:01:09Z","timestamp":1628679669000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2021\/59"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2021\/59","relation":{},"subject":[],"published":{"date-parts":[[2021,8]]}}}