On the approximability of the stable matching problem with ties of size two

Robert Chiang, Kanstantsin Pashkovich

The stable matching problem is one of the central problems of algorithmic game theory. If participants are allowed to have ties, the problem of finding a stable matching of maximum…