Approximating Stable Matchings with Ties of Bounded Size

Jochen Koenemann, Kanstantsin Pashkovich, Natig Tofigzade

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 matchin…