Sequences of the Stable Matching Problem
History and Overview
2022-01-04 v1
Abstract
In this paper, we begin by discussing different types of preference profiles related to the stable marriage problem. We then introduce the concept of soulmates, which are a man and a woman who rank each other first. Inversely, we examine hell-pairs, where a man and a woman rank each other last. We generate sequences enumerating preference profiles of different types. We also calculate sequences related to the egalitarian cost, or "quality", of a matching. In total, we introduce and discuss 30 new sequences related to the stable marriage problem and discuss 6 sequences that are already in the OEIS.
Cite
@article{arxiv.2201.00645,
title = {Sequences of the Stable Matching Problem},
author = {Matvey Borodin and Eric Chen and Aidan Duncan and Tanya Khovanova and Boyan Litchev and Jiahe Liu and Veronika Moroz and Matthew Qian and Rohith Raghavan and Garima Rastogi and Michael Voigt},
journal= {arXiv preprint arXiv:2201.00645},
year = {2022}
}
Comments
23 pages, no figures