Stable Roommates Problem: Revision history

28 April 2023

• curprev 09:1009:10, 28 April 2023‎ Admin talk contribs‎ 1,504 bytes −229‎ No edit summary

10 April 2023

• curprev 08:2308:23, 10 April 2023‎ Admin talk contribs‎ 1,733 bytes +2‎ No edit summary

15 February 2023

• curprev 14:4614:46, 15 February 2023‎ Admin talk contribs‎ 1,731 bytes −15‎ No edit summary
• curprev 13:0413:04, 15 February 2023‎ Admin talk contribs‎ 1,746 bytes +14‎ No edit summary
• curprev 12:0312:03, 15 February 2023‎ Admin talk contribs‎ 1,732 bytes −11‎ No edit summary

• curprev 10:2310:23, 15 February 2023‎ Admin talk contribs‎ 1,743 bytes +1,743‎ Created page with "{{DISPLAYTITLE:Stable Roommates Problem (Stable Matching Problem)}} == Description == Given $2n$ participants, each of participant ranks the others in strict order of preference. A matching is a set of $n$ disjoint pairs of participants. A matching $M$ in an instance of SRP is stable if there are no two participants $x$ and $y$, each of whom prefers the other to their partner in $M$. Such a pair is said to block $M$, or to be a blocking pair with respect to $M$. == Re..."