Stable roommates problem - Nepedia

Nepedia Back to Discover

Friends want to pick a room buddy. They each have a list of who they like best. We want everyone to be happy. Sometimes it is hard to pick. No one wants to switch partners. Can you find the best pairs?

41 words

Up Next

Stable matching problem

More to explore

✨ What else?

Related topics you might enjoy

Stable matching problem 0% Gale–Shapley algorithm 0% Matching (graph theory) 0% Maximum-cardinality matching 0% Bipartite graph 0% Gibbard–Satterthwaite theorem 0%

🔬 Go deeper

More advanced topics to explore

Gale–Shapley algorithm Bipartite graph Antichain Component (graph theory)

🪜 Step back

Simpler topics to build understanding

Stable matching problem Matching (graph theory) Maximum-cardinality matching Gibbard–Satterthwaite theorem

📚 Content adapted from Wikipedia | Readability: FK 13.7 | Vital Level 5