matching with transferable and nontransferable utility and for extremal stable matchings. In this paper, we rephrase their … whether a given aggregate matching is rationalizable. For matchings that are not rationalizable, we provide a simple greedy … algorithm that computes the minimum number of matches that need to be removed to obtain a rationalizable matching. We also show …