This paper develops an integer programming approach to two-sided many-to-one matching by investigating stable integral matchings of a fictitious market where each worker is divisible. We show that stable matching exists in a discrete matching market when firms' preference profile satisfies a...

This paper develops an integer programming approach to two-sided many-to-one matching by investigating stable integral matchings of a fictitious market where each worker is divisible. We show that a stable matching exists in a discrete matching market when the firms' preference profile satisfies...