Abstract

본 논문은 결혼 문제의 최적 해를 간단히 찾을 수 있는 알고리즘을 제안하였다. 일반적으로 결혼문제는 수행 복잡도 <TEX>$O({\mid}V{\mid}^2{\mid}E{\mid})$</TEX>의 Gale-Shapley 알고리즘으로 해를 구한다. 제안된 알고리즘은 먼저, 남성의 여성 선호도와 여성의 남성 선호도에 대해 상호-선호도 합 <TEX>$p_{ij}$</TEX>의 행렬로 변환시킨다. 두 번째로, 단순히 i행에서 최소값 <TEX>$_{min}p_i$</TEX>를 선택하여,<TEX>${\mid}p_{.j}{\mid}{\geq}2,j{\in}S$</TEX>, <TEX>${\mid}p_{.j}{\mid}=1$</TEX>, <TEX>$j{\in}H$</TEX>, <TEX>${\mid}p_{.j}{\mid}=0$</TEX>, <TEX>$j{\in}T$</TEX>로 설정하고, <TEX>$S{\rightarrow}T$</TEX>의 <TEX>$_{min}p_{sr}$</TEX>와 <TEX>$S{\rightarrow}H$</TEX>, <TEX>$H{\rightarrow}T$</TEX>의 <TEX>$p_{SH}+p_{HT}$</TEX>, <TEX>$p_{HT}</TEX><TEX><</TEX><TEX>{min}P_{ST}$</TEX>에 대해 <TEX>$_{min}\{_{min}p_{ST},p_{SH}+p_{HT\}$</TEX>를 이동시키는 방법을 적용하였다. 제안된 알고리즘은 Gale-Shapley 알고리즘의 수행 복잡도 <TEX>$O({\mid}V{\mid}^2{\mid}E{\mid})$</TEX>를 <TEX>$O({\mid}V{\mid}^2)$</TEX>으로 향상시켰다. 또한, 불균형 결혼 문제인 경우에도 적용될 수 있도록 확장성을 갖고 있다. This paper proposes a simplified algorithm devised to obtain optimal solution to the marriage problem. In solving this problem, the most widely resorted to is the Gale-Shapley algorithm with the time complexity of <TEX>$O({\mid}V{\mid}^2{\mid}E{\mid})$</TEX>. The proposed algorithm on the other hand firstly constructs a <TEX>$p_{ij}$</TEX> matrix of inter-preference sum both sexes' preference over the opposite sex. Secondly, it selects <TEX>$_{min}p_i$</TEX> from each row to establish <TEX>${\mid}p_{.j}{\mid}{\geq}2,j{\in}S$</TEX>, <TEX>${\mid}p_{.j}{\mid}=1$</TEX>, <TEX>$j{\in}H$</TEX>, <TEX>${\mid}p_{.j}{\mid}=0$</TEX>, <TEX>$j{\in}T$</TEX>. Finally, it shifts <TEX>$_{min}\{_{min}p_{ST},p_{SH}+p_{HT\}$</TEX> for <TEX>$_{min}P_{ST}$</TEX> of <TEX>$S{\rightarrow}T$</TEX> and <TEX>$p_{SH}+p_{HT}$</TEX>, <TEX>$p_{HT}</TEX><TEX><</TEX><TEX>_{min}p_{ST}$</TEX> of <TEX>$S{\righta</TEX><TEX>rrow}H$</TEX>, <TEX>$H{\rightarrow}T$</TEX>. The proposed algorithm has not only improved the Gale-Shapley's algorithm's complexity of <TEX>$O({\mid}V{\mid}^2{\mid}E{\mid})$</TEX> to <TEX>$O({\mid}V{\mid}^2)$</TEX> but also proved its extendable use on unbalanced marriage problems.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.