Optimisation Technique For Perfect Pairing
T P Rohit, Sasi Gopalan, V S Sunith, Amrutha Dinesh, Varsha Shaheen · Research Square · 2023
Abstract Research focuses on the aspects of finding ideal pairs among ’n’ entities under specified constraints. The entities are assumed to be perfectly logical and possess quantifiable properties only. Each entity given a set of criteria is expected to rate itself to maximize its probability of being paired with another entity of desired properties. After the rating ’n’ rank lists are prepared (one per each) by the entities so as to express their preference in matchmaking. The matchmaking is done using the pairing algorithm which pairs up two entities. The pairing is done in a way that reduces the total cost of the matches. The cost of a single match is calculated by taking the sum of the rank of the first entity in the second entity’s list and the rank of the second entity in the first entity’s list. Also, the algorithm must ensure all pairings are stable, that is if a pairing is made between (e1,e2) there must not be an er such that er exists above e2 in the rank list of e1 and e2 and e1 and e2 exist above the pairing of er.