Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity

Yuri Faenza, Clifford Stein, Jia Wan

Let $G$ be a graph and suppose we are given, for each $v\in V(G)$, a strict ordering of the neighbors of $v$. A set of matchings $\mathcal{M}$ of $G$ is called internally stable if t…