<preprint>
Popular Matchings with Ties and Matroid Constraints
Creator | |
---|---|
Language | |
Publisher | |
Date | |
Source Title | |
Vol | |
Publication Type | |
Access Rights | |
Related DOI | |
Related URI | |
Relation | |
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 |
Hide fulltext details.
File | FileType | Size | Views | Description |
---|---|---|---|---|
MI2015-6 | 171 KB | 531 |
Details
Record ID | |
---|---|
Peer-Reviewed | |
Notes | |
Created Date | 2015.09.28 |
Modified Date | 2018.01.24 |