Popular matchings with two-sided preference lists and matroid constraints

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)265-276
Number of pages12
JournalTheoretical Computer Science
Volume809
DOIs
Publication statusPublished - Feb 24 2020

Fingerprint

Matching Problem
Matroid
Polynomial time
Polynomials
Model

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Popular matchings with two-sided preference lists and matroid constraints. / Kamiyama, Naoyuki.

In: Theoretical Computer Science, Vol. 809, 24.02.2020, p. 265-276.

Research output: Contribution to journalArticle

@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 = "2",
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 -