arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2211.06887econ.TH
收藏

企业-工人超图

Firm-worker hypergraphs

Chao Huang

AI总结:

本文研究企业-工人超图结构,证明其无 非平凡奇环时两类多对一匹配存在稳定匹配,可应用于专业化企业与专业人才匹配场景。

摘要:

企业-工人超图由连接一家企业及其潜在雇员的边构成。我们证明,当企业-工人超图不存在非平凡奇环时,可转移效用的多对一匹配与离散多对一匹配中均存在稳定匹配。满足该条件的企业偏好出现在专业化企业与专业人才的匹配问题中。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑