Stable Matchings with Restricted Preferences: Structure and Complexity

Christine T. Cheng, Will Rosenbaum

It is well known that every stable matching instance $I$ has a rotation poset $R(I)$ that can be computed efficiently and the downsets of $R(I)$ are in one-to-one correspondence wi…