Three Persons Satisfactory Roommates Problem with Incomplete List
Main Article Content
Abstract
The Satisfactory Roommates Problem (SFRP) is the problem of finding satisfactory matching between any pair of roommates. In the complete list (SFRP) each person in the set of even cardinality ranks the others in order of preference. In the incomplete list (SFRPI) there is some member in the group prefers less than members. There are people in this Three Persons Satisfactory Roommates Problem with incomplete list (TPSRPI), and each person has a preference list for their two companions. Some people have preferences that are fewer than . A set of triples is referred to as a matching. A new, complex algorithm for locating perfect triples in rooms is presented in this study.
Article Details
Issue
Section
Articles