New fast iteration algorithm for the solution of generalized stable marriage problem

This paper proposes an iteration algorithm for the generated stable marriage problem, which is easier and more transparent than the conventional (extended) Gale-Shapley (GS) algorithm in the sense of programming and debugging. This paper also presents a fast version of the iteration algorithm and describes the result of comparative experimentation in execution time. The result shows that the proposed algorithm executes more than six times faster than the GS one, and this proves the effectiveness of the iteration method.