arXiv Open Access 2016

Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties

Tomomi Matsui Takayoshi Hamaguchi

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DS

Penulis (2)

Tomomi Matsui

Takayoshi Hamaguchi

Format Sitasi

APA MLA BibTeX

Matsui, T., Hamaguchi, T. (2016). Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties. https://arxiv.org/abs/1601.03458

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2016
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓