Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties
published by Tomomi Matsui
in 2016
in Informatics Engineering
and research's language is
English
Download
Abstract in English
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.