Stable roommates problem

Type of stable matching problem

In mathematics, economics and computer science, particularly in the fields of combinatorial game theory and algorithms, the stable-roommate problem (SRP) is the problem of finding a stable matching for an even-sized set. A matching is a separation of the set into disjoint pairs ("roommates"). The matching is stable if there are no two elements which are not roommates and which both prefer each other to their roommate under the matching.

From Wikipedia, under CC BY-SA. More on occurri.