Stable Marriage Problem: Revision history

28 April 2023

• curprev 09:1009:10, 28 April 2023‎ Admin talk contribs‎ 3,036 bytes −227‎ No edit summary

10 April 2023

• curprev 08:2208:22, 10 April 2023‎ Admin talk contribs‎ 3,263 bytes +2‎ No edit summary

15 February 2023

• curprev 14:4614:46, 15 February 2023‎ Admin talk contribs‎ 3,261 bytes −13‎ No edit summary
• curprev 14:3914:39, 15 February 2023‎ Admin talk contribs‎ 3,274 bytes −2‎ No edit summary
• curprev 13:0413:04, 15 February 2023‎ Admin talk contribs‎ 3,276 bytes +264‎ No edit summary
• curprev 12:0312:03, 15 February 2023‎ Admin talk contribs‎ 3,012 bytes −11‎ No edit summary

• curprev 10:2310:23, 15 February 2023‎ Admin talk contribs‎ 3,023 bytes +3,023‎ Created page with "{{DISPLAYTITLE:Stable Marriage Problem (Stable Matching Problem)}} == Description == Given $n$ men and $n$ women, where each person has ranked all members of the opposite sex in order of preference, marry the men and women together such that there are no two people of opposite sex who would both rather have each other than their current partners. When there are no such pairs of people, the set of marriages is deemed stable. == Related Problems == Generalizations: ..."