Open AccessThis article is
- freely available
Linear Time Local Approximation Algorithm for Maximum Stable Marriage
Department of Computer Science and MTA-ELTE Egerváry Research Group, Eötvös University, Pázmány Péter sétany 1/C, Budapest 1117, Hungary
Received: 1 August 2013; in revised form: 6 August 2013 / Accepted: 7 August 2013 / Published: 15 August 2013
Abstract: We consider a two-sided market under incomplete preference lists with ties, where the goal is to find a maximum size stable matching. The problem is APX-hard, and a 3/2-approximation was given by McDermid . This algorithm has a non-linear running time, and, more importantly needs global knowledge of all preference lists. We present a very natural, economically reasonable, local, linear time algorithm with the same ratio, using some ideas of Paluch . In this algorithm every person make decisions using only their own list, and some information asked from members of these lists (as in the case of the famous algorithm of Gale and Shapley). Some consequences to the Hospitals/Residents problem are also discussed.
Keywords: stable marriage; Gale-Shapley algorithm; approximation; Hospitals/Residents problem
Citations to this Article
Cite This Article
MDPI and ACS Style
Király, Z. Linear Time Local Approximation Algorithm for Maximum Stable Marriage. Algorithms 2013, 6, 471-484.
Király Z. Linear Time Local Approximation Algorithm for Maximum Stable Marriage. Algorithms. 2013; 6(3):471-484.
Király, Zoltán. 2013. "Linear Time Local Approximation Algorithm for Maximum Stable Marriage." Algorithms 6, no. 3: 471-484.