TY - JOUR
T1 - Envy-free matchings with one-sided preferences and matroid constraints
AU - Kamiyama, Naoyuki
N1 - Funding Information:
The author would like to thank the anonymous referee for helpful comments. This work was supported by JST, PRESTO Grant Number JPMJPR1753 , Japan.
Publisher Copyright:
© 2021 Elsevier B.V.
PY - 2021/9
Y1 - 2021/9
N2 - In this paper, we consider the problem of checking the existence of an envy-free matching in a many-to-one matching model with one-sided preferences and matroid constraints. For this problem, we propose a polynomial-time algorithm which is a generalization of the algorithm proposed by Gan, Suksompong, and Voudouris for the one-to-one setting. Furthermore, we consider a stronger variant of envy-freeness.
AB - In this paper, we consider the problem of checking the existence of an envy-free matching in a many-to-one matching model with one-sided preferences and matroid constraints. For this problem, we propose a polynomial-time algorithm which is a generalization of the algorithm proposed by Gan, Suksompong, and Voudouris for the one-to-one setting. Furthermore, we consider a stronger variant of envy-freeness.
UR - http://www.scopus.com/inward/record.url?scp=85113982972&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85113982972&partnerID=8YFLogxK
U2 - 10.1016/j.orl.2021.08.010
DO - 10.1016/j.orl.2021.08.010
M3 - Article
AN - SCOPUS:85113982972
VL - 49
SP - 790
EP - 794
JO - Operations Research Letters
JF - Operations Research Letters
SN - 0167-6377
IS - 5
ER -