Worst Case Scenario For Stable Matching Algorithm Visualized - Find such an input and explain why no stable matching exists. In layman terms, a matching is stable if no divorce happens. Then a pseudo code to check the stability of an arbitrary mu would be: If mu(w) in [men who are in w's preference. Though it has already been experimentally proved that the chances of having a worst case scenario for stable matching is extremely low, but occurrence of it. Therefore the worst case scenario for the stable marriage algorithm is: The sum of the worst case number of days where a man gets rejected and the one day where no man. My intuition is that i have to use contradiction. In worst case scenario, lets see number of days and number of proposals, the algorithm will take to find stable matching. Stable matching is a perfect matching with no unstable pairs.
Find such an input and explain why no stable matching exists. In layman terms, a matching is stable if no divorce happens. Then a pseudo code to check the stability of an arbitrary mu would be: If mu(w) in [men who are in w's preference. Though it has already been experimentally proved that the chances of having a worst case scenario for stable matching is extremely low, but occurrence of it.