  In this paper, we give a simple characterization of a set of popular
matchings defined by preference lists with ties. By employing our
characterization, we propose a polynomial time algorithm for finding a minimum
cost popular matching.
