论文标题

稳定匹配问题的序列

Sequences of the Stable Matching Problem

论文作者

Borodin, Matvey, Chen, Eric, Duncan, Aidan, Khovanova, Tanya, Litchev, Boyan, Liu, Jiahe, Moroz, Veronika, Qian, Matthew, Raghavan, Rohith, Rastogi, Garima, Voigt, Michael

论文摘要

在本文中,我们首先讨论与稳定婚姻问题有关的不同类型的偏好概况。然后,我们介绍了灵魂伴侣的概念,这是一个男人和女人,他们首先互相排名。相反,我们检查地狱对,一个男人和一个女人最后排名。我们生成列举不同类型的偏好曲线的序列。我们还计算了与匹配的平等成本或“质量”相关的序列。总的来说,我们介绍并讨论了与稳定婚姻问题有关的30个新序列,并讨论了OEI中已经存在的6个序列。

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.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源