Approximating Stable Matchings with Ties of Bounded Size
Computer Science and Game Theory
2020-07-15 v2 Optimization and Control
Abstract
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 -approximation algorithm for the stable matching problem with ties of size at most and incomplete lists. Our result matches the known lower bound on the integrality gap for the associated LP formulation.
Cite
@article{arxiv.2005.05228,
title = {Approximating Stable Matchings with Ties of Bounded Size},
author = {Jochen Koenemann and Kanstantsin Pashkovich and Natig Tofigzade},
journal= {arXiv preprint arXiv:2005.05228},
year = {2020}
}