TY - JOUR
T1 - Popular matchings with two-sided preference lists and matroid constraints
AU - Kamiyama, Naoyuki
N1 - Publisher Copyright:
© 2019 Elsevier B.V.
PY - 2020/2/24
Y1 - 2020/2/24
N2 - In this paper, we consider the popular matching problem with two-sided preference lists and matroid constraints, which is based on the variants of the popular matching problem proposed by Brandl and Kavitha, and Nasre and Rawat. We prove that there always exists a popular matching in our model, and a popular matching can be found in polynomial time. Furthermore, we prove that if every matroid is weakly base orderable, then we can find a maximum-size popular matching in polynomial time.
AB - In this paper, we consider the popular matching problem with two-sided preference lists and matroid constraints, which is based on the variants of the popular matching problem proposed by Brandl and Kavitha, and Nasre and Rawat. We prove that there always exists a popular matching in our model, and a popular matching can be found in polynomial time. Furthermore, we prove that if every matroid is weakly base orderable, then we can find a maximum-size popular matching in polynomial time.
KW - Matroid
KW - Popular matching
KW - Stable matching
UR - https://www.scopus.com/pages/publications/85076853579
UR - https://www.scopus.com/inward/citedby.url?scp=85076853579&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2019.12.017
DO - 10.1016/j.tcs.2019.12.017
M3 - Article
AN - SCOPUS:85076853579
SN - 0304-3975
VL - 809
SP - 265
EP - 276
JO - Theoretical Computer Science
JF - Theoretical Computer Science
ER -