%0 Journal Article %A Zhengnan Shi %D 2009 %J International Journal of Mathematical and Computational Sciences %B World Academy of Science, Engineering and Technology %I Open Science Index 35, 2009 %T A Self-stabilizing Algorithm for Maximum Popular Matching of Strictly Ordered Preference Lists %U https://publications.waset.org/pdf/12607 %V 35 %X 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). %P 944 - 953