Combinatorial Optimization Reading Group - Madison Van Dyk

Title: A (1 + 1/e)-Approximation Algorithm for Maximum Stable Matching with One-Sided Ties and Incomplete Lists

Abstract:

We will continue the discussion of stable matching when there are unacceptable pairs and one-sided ties. Two weeks ago, we looked at a 3/2-approximation that was purely combinatorial. This week we will discuss an LP formulation for the problem and how an optimal solution to the LP can be used to adjust priorities. The analysis of this algorithm relies on establishing and solving a factor-revealing optimization problem. This talk is based on the work of Chi-Kit Lam and C. Gregory Plaxton with the same title.