A characterization of weighted popular matchings under matroid constraints

研究成果: Contribution to journalArticle

抜粋

The popular matching problem introduced by Abraham, Irving, Kavitha, and Mehlhorn is one of bipartite matching problems with one-sided preference lists. In this paper, we first propose a matroid generalization of the weighted variant of popular matchings introduced by Mestre. Then we give a characterization of weighted popular matchings in bipartite graphs with matroid constraints and one-sided preference lists containing no ties. This characterization is based on the characterization of weighted popular matchings proved by Mestre. Lastly we prove that we can decide whether a given matching is a weighted popular matching under matroid constraints in polynomial time by using our characterization.

元の言語英語
ページ(範囲)2-17
ページ数16
ジャーナルJournal of the Operations Research Society of Japan
61
発行部数1
DOI
出版物ステータス出版済み - 1 2018

All Science Journal Classification (ASJC) codes

  • Decision Sciences(all)
  • Management Science and Operations Research

フィンガープリント A characterization of weighted popular matchings under matroid constraints' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用