A Parallel Algorithm to Solve the Stable Marriage Problem

[[abstract]]In this paper a parallel algorithm to solve the stable marriage problem is given. The worst case performance of this algorithm is stated. A theoretical analysis shows that the probability of the occurrence of this worst case is extremely small. For instance, if there are sixteen men and sixteen women involved, then the probability that the worst case occurs is only 10–45. Possible future research is also discussed in this paper.[[fileno]]2030256010087[[department]]資訊工程學