본문 바로가기
  • Home

A Marriage Problem Using Threshold Algorithm

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2015, 20(11), pp.105-110
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang-Un, Lee 1

1강릉원주대학교

Accredited

ABSTRACT

This paper deals with a newly proposed algorithm for stable marriage problem, which I coin threshold algorithm. The proposed algorithm firstly constructs an n × n matrix of the sum of each sex’s preference over the members of the opposite sex. It then selects the minimum value from each row and column to designate the maximum value of the selected as the sum threshold pij*∗. It subsequently deletes the maximum preference maxpij from a matrix derived from deleting pij>pij ∗ , until │ci│=1 or │cj│=1 . Finally, it undergoes an optimization process in which the sum preference is minimized. When tested on 7 stable marriage problems, the proposed algorithm has proved to improve on the existing solutions.

Citation status

* References for papers published after 2023 are currently being built.