Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties
Data Structures and Algorithms
2025-03-07 v2
Abstract
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.
Keywords
Cite
@article{arxiv.1601.03458,
title = {Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties},
author = {Tomomi Matsui and Takayoshi Hamaguchi},
journal= {arXiv preprint arXiv:1601.03458},
year = {2025}
}
Comments
8 pages