Minimal conversely consistent extension of the men-optimal solution

This study pertains to two-sided, one-to-one matching problems and considers the best-known solution concept: the men-optimal solution. The men-optimal solution fails to satisfy consistency as well as converse consistency. Furthermore, the minimal consistent extension of the men-optimal solution equals the core. In this article, we compute the minimal conversely consistent extension of the men-optimal solution as a correspondence which associates with each problem the set consisting of the men-optimal matching, and all stable and men-barterproof matchings for this problem.