Finding strongly popular b-matchings in bipartite graphs

The computational complexity of the bipartite popular matching problem depends on how indifference appears in the preference lists. If one side has strict preferences while nodes on the other side are all indifferent (but prefer to be matched), then a popular matching can be found in polynomial time...

Full description

Saved in:
Bibliographic Details
Published in:European journal of combinatorics 2020-08, Vol.88, p.103105, Article 103105
Main Authors: Király, Tamás, Mészáros-Karkus, Zsuzsa
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The computational complexity of the bipartite popular matching problem depends on how indifference appears in the preference lists. If one side has strict preferences while nodes on the other side are all indifferent (but prefer to be matched), then a popular matching can be found in polynomial time (Cseh et al., 2015). However, as the same paper points out, the problem becomes NP-complete if nodes with strict preferences are allowed on both sides and indifferent nodes are allowed on one side. We show that the problem of finding a strongly popular matching is polynomial-time solvable even in the latter case. More generally, we give a polynomial-time algorithm for the many-to-many version, i.e. the strongly popular b-matching problem, in the setting where one side has strict preferences while agents on the other side may have one tie of arbitrary length at the end of their preference list.
ISSN:0195-6698
1095-9971
DOI:10.1016/j.ejc.2020.103105