DeepAI AI Chat
Log In Sign Up

NC Algorithms for Popular Matchings in One-Sided Preference Systems and Related Problems

by   Changyong Hu, et al.

The popular matching problem is of matching a set of applicants to a set of posts, where each applicant has a preference list, ranking a non-empty subset of posts in the order of preference, possibly with ties. A matching M is popular if there is no other matching M' such that more applicants prefer M' to M. We give the first NC algorithm to solve the popular matching problem without ties. We also give an NC algorithm that solves the maximum-cardinality popular matching problem. No NC or RNC algorithms were known for the matching problem in preference systems prior to this work. Moreover, we give an NC algorithm for a weaker version of the stable matching problem, that is, the problem of finding the "next" stable matching given a stable matching.


page 1

page 2

page 3

page 4


Two-sided popular matchings in bipartite graphs with forbidden/forced elements and weights

Two-sided popular matchings in bipartite graphs are a well-known general...

Solving the Maximum Popular Matching Problem with Matroid Constraints

We consider the problem of finding a maximum popular matching in a many-...

Preference Cycles in Stable Matchings

Consider the stable matching problem on two sets. We introduce the conce...

Manipulation Strategies for the Rank Maximal Matching Problem

We consider manipulation strategies for the rank-maximal matching proble...

Approximately Stable Matchings with General Constraints

This paper focuses on two-sided matching where one side (a hospital or f...

Two-Sided Random Matching Markets: Ex-Ante Equivalence of the Deferred Acceptance Procedures

Stable matching in a community consisting of N men and N women is a clas...

Farsighted Collusion in Stable Marriage Problem

The Stable Marriage Problem, as proposed by Gale and Shapley, considers ...