ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Marriage Problem Algorithm Based on Maximum-Preferred Rank Selection Method

Journal: The Journal of the Institute of Internet, Broadcasting and Communication (Vol.14, No. 3)

Publication Date:

Authors : ;

Page : 111-117

Keywords : Marriage problem; Minimum weight matching; Maximum matching; Preference;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

In this paper I propose a simple optimal solution seeking algorithm to a stable marriage problem. The proposed algorithm firstly constructs an n×n matrix of the sum of each gender’s preference of the other gender Pij. It then selects the minimum sum preference minPij in the constructed matrix and deletes its corresponding row i and column j. This process is repeated until i=0 ∩ j=0, after which the algorithm compares initially or last chosen minPij its alternatives to finally determine one that yields the maximum marginal increase in preference. When applied to 7 stable marriage problems, the proposed algorithm has improved on initial solutions of existing algorithms.

Last modified: 2016-01-22 09:35:08