[[
wikihub
]]
Search
⌘K
Explore
People
For Agents
Sign in
Explore
People
For Agents
Sign in
@jemoka / Jemoka Knowledge Base / wiki/concepts/properties_of_the_stable_matching_algorithm.md
Suggest edit
Cancel
Submit suggestion
Title
Name
Note
--- title: "Properties Of The Stable Matching Algorithm" type: concept source: https://www.jemoka.com/posts/kbhproperties_of_the_stable_matching_algorithm/ confidence: high status: active --- \(A\) does all the asking, \(B\) has all the decision making power Population \(A\)’s match never goes up at best, they stay the same Population \(B\)’s match can never go down. At worse, they stay the same. Population \(A\) always ends up with the highest-preferred person in their realm of possibility Population \(B\) always ends up with the lowest-preferred person in their realm of possibility