A sublinear parallel algorithm for stable matching

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.

Authors

• Tomás Feder
• Nimrod Megiddo
• Serge A. Plotkin

Keywords

• Non-expansive circuits
• Linear programming
• Stable matching