Academic Journals Database
Disseminating quality controlled scientific knowledge

Linear Time Local Approximation Algorithm for Maximum Stable Marriage

ADD TO MY LIST
 
Author(s): Zoltán Király

Journal: Algorithms
ISSN 1999-4893

Volume: 6;
Issue: 3;
Start page: 471;
Date: 2013;
Original page

Keywords: stable marriage | Gale-Shapley algorithm | approximation | Hospitals/Residents problem

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.
RPA Switzerland

Robotic Process Automation Switzerland

    

Tango Jona
Tangokurs Rapperswil-Jona