Marriage Market with Indifferences: A Linear Programming Approach

We study stable and strongly stable matchings in the marriage market with indifference in their preferences. We characterize the stable matchings as integer extreme points of a convex polytope. We give an alternative proof for the integrity of the strongly stable matching polytope. Also, we compute men-optimal (women-optimal) stable and strongly stable matchings using linear programming. When preferences are strict, we find the men-optimal (women-optimal) stable matching.