TY - JFULL AU - Zhengnan Shi PY - 2009/12/ TI - A Self-stabilizing Algorithm for Maximum Popular Matching of Strictly Ordered Preference Lists T2 - International Journal of Mathematical and Computational Sciences SP - 943 EP - 953 VL - 3 SN - 1307-6892 UR - https://publications.waset.org/pdf/12607 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 35, 2009 N2 - In this paper, we consider the problem of Popular Matching of strictly ordered preference lists. A Popular Matching is not guaranteed to exist in any network. We propose an IDbased, constant space, self-stabilizing algorithm that converges to a Maximum Popular Matching an optimum solution, if one exist. We show that the algorithm stabilizes in O(n5) moves under any scheduler (daemon). ER -