On the Approximability of the Stable Matching Problem with Ties of Constant Size up to the Integrality Gap

05/11/2020
by   Jochen Koenemann, et al.
0

Finding a stable matching is one of the central problems in algorithmic game theory. If participants are allowed to have ties and incomplete preferences, computing a stable matching of maximum cardinality is known to be NP-hard. In this paper we present a (3L-2)/(2L-1)-approximation algorithm for the stable matching problem with ties of size at most L and incomplete lists. Our result matches the known lower bound on the integrality gap for the associated LP formulation.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset