TY - JOUR
T1 - The envy-free matching problem with pairwise preferences
AU - Kamiyama, Naoyuki
N1 - Funding Information:
The author would like to thank the anonymous referees for helpful comments. The idea of the algorithm in Section 4 for the case where for every agent is proposed by one of the referees. This work was supported by JST , PRESTO Grant Number JPMJPR1753 , Japan.
Publisher Copyright:
© 2021 Elsevier B.V.
PY - 2021/12
Y1 - 2021/12
N2 - In this paper, we consider the situation where each agent has a preference over a subset of items and exactly one item is matched to each agent. The envy-freeness of a matching guarantees that no one has envy for the others. We consider an envy-free matching in the situation where each agent has a preference that is defined based on comparisons of any two acceptable items. We prove that in this situation, the problem of checking the existence of an envy-free matching is generally hard.
AB - In this paper, we consider the situation where each agent has a preference over a subset of items and exactly one item is matched to each agent. The envy-freeness of a matching guarantees that no one has envy for the others. We consider an envy-free matching in the situation where each agent has a preference that is defined based on comparisons of any two acceptable items. We prove that in this situation, the problem of checking the existence of an envy-free matching is generally hard.
UR - http://www.scopus.com/inward/record.url?scp=85108074010&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85108074010&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2021.106158
DO - 10.1016/j.ipl.2021.106158
M3 - Article
AN - SCOPUS:85108074010
VL - 172
JO - Information Processing Letters
JF - Information Processing Letters
SN - 0020-0190
M1 - 106158
ER -