Stable matching: an integer programming approach
Theoretical Economics
2023-09-11 v2
Abstract
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 matchings exist in a discrete matching market when 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.
Cite
@article{arxiv.2103.03418,
title = {Stable matching: an integer programming approach},
author = {Chao Huang},
journal= {arXiv preprint arXiv:2103.03418},
year = {2023}
}