We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Linear Time Local Approximation Algorithm for Maximum Stable Marriage.
- Authors
Király, Zoltán
- 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 [1]. 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 [2]. 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.
- Subjects
APPROXIMATION algorithms; MARRIAGE theorem; MATCHING theory; LINEAR time invariant systems; RATIO &; proportion
- Publication
Algorithms, 2013, Vol 6, Issue 3, p471
- ISSN
1999-4893
- Publication type
Article
- DOI
10.3390/a6030471