Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2016
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1601.03458 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908256806371328 |
|---|---|
| author | Matsui, Tomomi Hamaguchi, Takayoshi |
| author_facet | Matsui, Tomomi Hamaguchi, Takayoshi |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1601_03458 |
| institution | arXiv |
| publishDate | 2016 |
| record_format | arxiv |
| spellingShingle | Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties Matsui, Tomomi Hamaguchi, Takayoshi Data Structures and Algorithms 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. |
| title | Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/1601.03458 |