Fast Kansei Matching Method as an Algorithm for the Solution of Extended Stable Marriage Problem

Abstract

This paper proposes a fast iteration algorithm for Kansei matching as an algorithm for solving the general 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, while it requires the same memory storage as GS one, and this proves the effectiveness of the iteration method.