Stable matching: An integer programming approach
提出一种整数规划方法研究双边多对一匹配，通过分析可分割工人虚拟市场中的稳定整数匹配，证明了当企业偏好满足全幺模条件时离散匹配市场存在稳定匹配，并给出满足该条件的一类偏好形式。
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 a total unimodularity condition that is compatible with various forms of complementarities. We provide a class of firms' preference profiles that satisfy this condition.