论文标题
公司工作者超图
Firm-worker hypergraphs
论文作者
论文摘要
公司工作人员的超图由边缘组成，每个边缘都会加入公司及其可能的员工。我们表明，当公司工人超图没有非平凡的奇数周期时，多对一匹配与可转移的实用程序的多对一匹配和离散的多一对一匹配都存在稳定的匹配。公司满足这种条件的偏好是在将专业公司与专家匹配的问题中出现的。
A firm-worker hypergraph consists of edges in which each edge joins a firm and its possible employees. We show that a stable matching exists in both many-to-one matching with transferable utilities and discrete many-to-one matching when the firm-worker hypergraph has no nontrivial odd-length cycle. Firms' preferences satisfying this condition arise in a problem of matching specialized firms with specialists.
