Assume that we are given a set of applicants and a set of posts such that each applicant has a preference list over the posts. A matching M between the applicants and the posts is said to be popular if there is no other matching N such that the number of applicants that prefer N to M is larger than the number of applicants that prefer M to N. Then, the goal of the popular matching problem is to decide whether there is a popular matching, and find a popular matching if one exists. Abraham, Irving, Kavitha, and Mehlhorn proved that this problem can be solved in polynomial time even if the preference lists contain ties. In this paper, we consider the popular matching problem with matroid constraints. In this problem, for each post, we are given a matroid on the set of applicants. A set of applicants assigned to each post must be an independent set of its matroid. Kamiyama proved that if there is not a tie in the preference lists, then this problem can be solved in polynomial time. In this paper, we prove that even if there are ties in the preference lists, this problem can be solved in polynomial time.
All Science Journal Classification (ASJC) codes