Stable Matching Stable Matching:a matching without any blocking pair Given a matching,you can verify whether it's a stable matching in O(n2) time,but Dose stable matching always exist? 。 How to find a stable matching? Men Women 1: CBEAD A:35214 2:ABECD B:52143 3:DCBAE C:43512 4:ACDBE D:12345 5:ABDEC E:23415Stable Matching Men Women 1: CBEAD A : 35214 2 : ABECD B : 52143 3 : DCBAE C : 43512 4 : ACDBE D : 12345 5 : ABDEC E : 23415 Stable Matching: a matching without any blocking pair Given a matching, you can verify whether it’s a stable matching in O(n2) time, but • Dose stable matching always exist? • How to find a stable matching?