TY - GEN
T1 - On stable matchings with pairwise preferences and matroid constraints
AU - Kamiyama, Naoyuki
N1 - Funding Information:
∗This research was supported by JST, PRESTO Grant Number JPMJPR1753, Japan.
Publisher Copyright:
© 2020 International Foundation for Autonomous.
PY - 2020
Y1 - 2020
N2 - In this paper, we consider the following generalization of the stable matching problem. We are given a set of doctors and a set of hospitals. In the classical model, each doctor has a strict total order over the hospitals. On the other hand, in our model, each doctor has a pairwise preference over the hospitals, which was introduced by Farczadi, Georgiou, and Könemann. Roughly speaking, in a pairwise preference, transitivity does not necessarily hold, and a comparison between some hospitals is not relevant to stability. Furthermore, we generalize capacity constraints on the hospitals to matroid constraints. Especially, we focus on the situation in which we are given a master list over the doctors, and the preference list of each hospital over the doctors is derived from this master list. For this problem, we give several hardness results and polynomial-time solvable cases.
AB - In this paper, we consider the following generalization of the stable matching problem. We are given a set of doctors and a set of hospitals. In the classical model, each doctor has a strict total order over the hospitals. On the other hand, in our model, each doctor has a pairwise preference over the hospitals, which was introduced by Farczadi, Georgiou, and Könemann. Roughly speaking, in a pairwise preference, transitivity does not necessarily hold, and a comparison between some hospitals is not relevant to stability. Furthermore, we generalize capacity constraints on the hospitals to matroid constraints. Especially, we focus on the situation in which we are given a master list over the doctors, and the preference list of each hospital over the doctors is derived from this master list. For this problem, we give several hardness results and polynomial-time solvable cases.
UR - http://www.scopus.com/inward/record.url?scp=85096648818&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85096648818&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85096648818
T3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
SP - 584
EP - 591
BT - Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020
A2 - An, Bo
A2 - El Fallah Seghrouchni, Amal
A2 - Sukthankar, Gita
PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
T2 - 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020
Y2 - 19 May 2020
ER -