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").
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").
Source: Wikipedia "Stable roommates problem" · CC BY-SA 4.0
Share this article: X · Bluesky