Popular matchings with two-sided preference lists and matroid constraints

Naoyuki Kamiyama

doi:10.1016/j.tcs.2019.12.017

Popular matchings with two-sided preference lists and matroid constraints

Naoyuki Kamiyama

Division of Advanced Mathematics Technology

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	265-276
Number of pages	12
Journal	Theoretical Computer Science
Volume	809
DOIs	https://doi.org/10.1016/j.tcs.2019.12.017
Publication status	Published - Feb 24 2020

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1016/j.tcs.2019.12.017

Fingerprint Dive into the research topics of 'Popular matchings with two-sided preference lists and matroid constraints'. Together they form a unique fingerprint.

Cite this

@article{9852fe220b414a889bf3112e9a6552f6,

title = "Popular matchings with two-sided preference lists and matroid constraints",

abstract = "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.",

author = "Naoyuki Kamiyama",

year = "2020",

month = feb,

day = "24",

doi = "10.1016/j.tcs.2019.12.017",

language = "English",

volume = "809",

pages = "265--276",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

}

TY - JOUR

T1 - Popular matchings with two-sided preference lists and matroid constraints

AU - Kamiyama, Naoyuki

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.

UR - http://www.scopus.com/inward/record.url?scp=85076853579&partnerID=8YFLogxK

UR - http://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

VL - 809

SP - 265

EP - 276

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -