---
title: "Properties Of The Stable Matching Algorithm"
source: https://www.jemoka.com/posts/kbhproperties_of_the_stable_matching_algorithm/
---

\(A\) does all the asking, \(B\) has all the decision making power Population \(A\)&rsquo;s match never goes up at best, they stay the same Population \(B\)&rsquo;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
