プレプリント Popular Matchings with Ties and Matroid Constraints

Kamiyama, Naoyuki

20152015-05-24 , Faculty of Mathematics, Kyushu University
内容記述
In this paper, we consider the popular matching problem with matroid constraints. It is known that if there exists no tie in preference lists of applicants, then this problem can be solved in polynomial time. In this paper, we prove that even if there exist ties in preference lists, this problem can be solved in polynomial time.
本文を読む

http://catalog.lib.kyushu-u.ac.jp/handle/2324/1525809/MI2015-6.pdf

このアイテムのアクセス数:  回

その他の情報