Popular Matchings with Ties and Matroid Constraints - Collections

＜preprint＞
Popular Matchings with Ties and Matroid Constraints

Creator	Creator Name Kamiyama, Naoyuki 神山, 直之カミヤマ, ナオユキ Affiliation Affiliation Name Institute of Mathematics for Industry, Kyushu University \| JST, PRESTO 九州大学マス・フォア・インダストリ研究所 \| 科学技術振興機構さきがけ
Language	English
Publisher	Faculty of Mathematics, Kyushu University
Publisher	九州大学大学院数理学研究院
Date	2015-05-24
Source Title	MI Preprint Series
Vol	2015-6
Publication Type	Author's Original
Access Rights	open access
Related DOI	https://www.math.kyushu-u.ac.jp/
Related URI	https://www.math.kyushu-u.ac.jp/
Relation	https://www.math.kyushu-u.ac.jp/
Abstract	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 polynomi...al time. In this paper, we prove that even if there exist ties in preference lists, this problem can be solved in polynomial time.show more

File	FileType	Size	Views	Description
MI2015-6	pdf	171 KB	531

Record ID	1525809
Peer-Reviewed	Unrefereed
Notes	The Global COE Program Mathematics-for-Industry Education & Research Hub
Notes	グローバルCOEプログラム「マス･フォア･インダストリ教育研究拠点」
Created Date	2015.09.28
Modified Date	2018.01.24