Popular matchings with two-sided preference lists and matroid constraints

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

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

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