Firm-worker hypergraphs
Theoretical Economics
2023-11-13 v3
Abstract
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.
Keywords
Cite
@article{arxiv.2211.06887,
title = {Firm-worker hypergraphs},
author = {Chao Huang},
journal= {arXiv preprint arXiv:2211.06887},
year = {2023}
}
Comments
Minor revision