An Edge-Based Algorithm for Solving the Right Partner Problem

The essence of the right partner problem is to pair people together based on their preferences of likes and dislikes towards other people. It can be considered as a special case of matching problem, assignment problem with some similarities to the grouping problem. In the right partner and grouping problems, people are paired/grouped together from one set, whereas in the other problems, groups are formed from two disjoint sets. In this research, the authors propose a new algorithm that satisfies most of the preferences based on an undirected weighted graph. The produced results are compared to those of the already existing novel graph-based algorithm. Both algorithms are implemented and tested under several scenarios using the same data instances. Based on the produced results, it is concluded that the edge-based algorithm outperforms the novel graph-based algorithm.