Marriage Problem Algorithm based on the Maximum Dispreference Sum-Delete Method

In this paper proposes a stable marriage algorithm. The proposed algorithm firstly constructs an matrix of men’s and women’s sum preference over opposite sex . It then repeatedly deletes row or column corresponding to the then maximum dispreference sum until If then we select the of then the row or column values are deleted repeatedly until When tested on 7 stable marriage problems, the proposed algorithm has proved to improve on the existing solutions.