Back to Search
Start Over
Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties
- Publication Year :
- 2016
-
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.<br />Comment: 8 pages
- Subjects :
- Computer Science - Data Structures and Algorithms
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1601.03458
- Document Type :
- Working Paper