The purpose of this paper is to consider the worst-case choice for the sequential stable matching problem. We give the necessary and sufficient condition for the worst-case execution, which leads the sequential stable matching algorithm to take the maximum number of proposals. We then point out that the probability that the worst-case execution occurs when a sequential stable matching algorithm is employed is extremely small.
