Note on the size of a stable matching
Theoretical Economics
2025-06-02 v1
Abstract
Consider a one-to-one two-sided matching market with workers on one side and single-position firms on the other, and suppose that the largest individually rational matching contains pairs. We show that the number of workers employed and positions filled in every stable matching is bounded from below by and we characterise the class of preferences that attain the bound.
Cite
@article{arxiv.2505.24637,
title = {Note on the size of a stable matching},
author = {Gregory Z. Gutin and Philip R. Neary and Anders Yeo},
journal= {arXiv preprint arXiv:2505.24637},
year = {2025}
}