0

Given 4 men and 4 women, I need to come up with a stable matching with at least 3 stable matching. I know there can be 2 stable matching depending on if men propose to women or women propose to men, but how can there be more than 3 stable matching. can anyone give me an example based on the condition given? thanks a lot.

flag
1 
 @Alex: The Gale–Shapley algorithm finds some stable matching, but there may be plenty of others. The question is to exhibit a graph which admits at least three different stable matchings. I think the question is quite clear, but I’m worried it’s not research-level. – Emil Jeřábek Jan 14 at 20:29

closed as off topic by Noah Stein, David White, Anthony Quas, Chris Godsil, Leonid Positselski Jan 14 at 22:07

Browse other questions tagged or ask your own question.