Algorithms 2014, 7(2), 189-202; doi:10.3390/a7020189

Faster and Simpler Approximation of Stable Matchings

Received: 5 September 2013; in revised form: 22 March 2014 / Accepted: 27 March 2014 / Published: 4 April 2014
(This article belongs to the Special Issue Special Issue on Matching under Preferences)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: We give a 3 2 -approximation algorithm for finding stable matchings that runs in O(m) time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(n3/2m) time, where n denotes the number of people andm is the total length of the preference lists in a given instance. In addition, the algorithm and the analysis are much simpler. We also give the extension of the algorithm for computing stable many-to-many matchings.
Keywords: stable matching; stable marriage; approximation algorithm
PDF Full-text Download PDF Full-Text [234 KB, uploaded 4 April 2014 09:37 CEST]

Export to BibTeX |

MDPI and ACS Style

Paluch, K. Faster and Simpler Approximation of Stable Matchings. Algorithms 2014, 7, 189-202.

AMA Style

Paluch K. Faster and Simpler Approximation of Stable Matchings. Algorithms. 2014; 7(2):189-202.

Chicago/Turabian Style

Paluch, Katarzyna. 2014. "Faster and Simpler Approximation of Stable Matchings." Algorithms 7, no. 2: 189-202.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert