A sublinear parallel algorithm for stable matching

Abstract

A parallel algorithm for the stable matching problem is presented. The algorithm is based on the primal-dual interior path-following method for linear programming. The main result is that a stable matching can be found in O*(√m) time by a polynomial number of processors, where m is the total length of preference lists of individuals. © 2000 Published by Elsevier Science B.V. All rights reserved.