Sequences of the Stable Matching Problem
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 g...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2021-12 |
|---|---|
| Hauptverfasser: | , , , , , , , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Borodin, Matvey Chen, Eric Duncan, Aidan Khovanova, Tanya Litchev, Boyan Liu, Jiahe Moroz, Veronika Qian, Matthew Raghavan, Rohith Rastogi, Garima Voigt, Michael |
| description | 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. |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2616483318</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2616483318</sourcerecordid><originalsourceid>FETCH-proquest_journals_26164833183</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mTQCE4tLE3NS04tVshPUyjJSFUILklMyklV8E0sSc7IzEtXCCjKB_JzeRhY0xJzilN5oTQ3g7Kba4izh25BUT7QhOKS-Kz80qI8oFS8kZmhmYkF0E4LY-JUAQB6vi-6</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2616483318</pqid></control><display><type>article</type><title>Sequences of the Stable Matching Problem</title><source>Free E- Journals</source><creator>Borodin, Matvey ; Chen, Eric ; Duncan, Aidan ; Khovanova, Tanya ; Litchev, Boyan ; Liu, Jiahe ; Moroz, Veronika ; Qian, Matthew ; Raghavan, Rohith ; Rastogi, Garima ; Voigt, Michael</creator><creatorcontrib>Borodin, Matvey ; Chen, Eric ; Duncan, Aidan ; Khovanova, Tanya ; Litchev, Boyan ; Liu, Jiahe ; Moroz, Veronika ; Qian, Matthew ; Raghavan, Rohith ; Rastogi, Garima ; Voigt, Michael</creatorcontrib><description>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.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Matching</subject><ispartof>arXiv.org, 2021-12</ispartof><rights>2021. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>780,784</link.rule.ids></links><search><creatorcontrib>Borodin, Matvey</creatorcontrib><creatorcontrib>Chen, Eric</creatorcontrib><creatorcontrib>Duncan, Aidan</creatorcontrib><creatorcontrib>Khovanova, Tanya</creatorcontrib><creatorcontrib>Litchev, Boyan</creatorcontrib><creatorcontrib>Liu, Jiahe</creatorcontrib><creatorcontrib>Moroz, Veronika</creatorcontrib><creatorcontrib>Qian, Matthew</creatorcontrib><creatorcontrib>Raghavan, Rohith</creatorcontrib><creatorcontrib>Rastogi, Garima</creatorcontrib><creatorcontrib>Voigt, Michael</creatorcontrib><title>Sequences of the Stable Matching Problem</title><title>arXiv.org</title><description>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.</description><subject>Matching</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mTQCE4tLE3NS04tVshPUyjJSFUILklMyklV8E0sSc7IzEtXCCjKB_JzeRhY0xJzilN5oTQ3g7Kba4izh25BUT7QhOKS-Kz80qI8oFS8kZmhmYkF0E4LY-JUAQB6vi-6</recordid><startdate>20211229</startdate><enddate>20211229</enddate><creator>Borodin, Matvey</creator><creator>Chen, Eric</creator><creator>Duncan, Aidan</creator><creator>Khovanova, Tanya</creator><creator>Litchev, Boyan</creator><creator>Liu, Jiahe</creator><creator>Moroz, Veronika</creator><creator>Qian, Matthew</creator><creator>Raghavan, Rohith</creator><creator>Rastogi, Garima</creator><creator>Voigt, Michael</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20211229</creationdate><title>Sequences of the Stable Matching Problem</title><author>Borodin, Matvey ; Chen, Eric ; Duncan, Aidan ; Khovanova, Tanya ; Litchev, Boyan ; Liu, Jiahe ; Moroz, Veronika ; Qian, Matthew ; Raghavan, Rohith ; Rastogi, Garima ; Voigt, Michael</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_26164833183</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Matching</topic><toplevel>online_resources</toplevel><creatorcontrib>Borodin, Matvey</creatorcontrib><creatorcontrib>Chen, Eric</creatorcontrib><creatorcontrib>Duncan, Aidan</creatorcontrib><creatorcontrib>Khovanova, Tanya</creatorcontrib><creatorcontrib>Litchev, Boyan</creatorcontrib><creatorcontrib>Liu, Jiahe</creatorcontrib><creatorcontrib>Moroz, Veronika</creatorcontrib><creatorcontrib>Qian, Matthew</creatorcontrib><creatorcontrib>Raghavan, Rohith</creatorcontrib><creatorcontrib>Rastogi, Garima</creatorcontrib><creatorcontrib>Voigt, Michael</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Borodin, Matvey</au><au>Chen, Eric</au><au>Duncan, Aidan</au><au>Khovanova, Tanya</au><au>Litchev, Boyan</au><au>Liu, Jiahe</au><au>Moroz, Veronika</au><au>Qian, Matthew</au><au>Raghavan, Rohith</au><au>Rastogi, Garima</au><au>Voigt, Michael</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Sequences of the Stable Matching Problem</atitle><jtitle>arXiv.org</jtitle><date>2021-12-29</date><risdate>2021</risdate><eissn>2331-8422</eissn><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.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2021-12 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_proquest_journals_2616483318 |
| source | Free E- Journals |
| subjects | Matching |
| title | Sequences of the Stable Matching Problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T13%3A00%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Sequences%20of%20the%20Stable%20Matching%20Problem&rft.jtitle=arXiv.org&rft.au=Borodin,%20Matvey&rft.date=2021-12-29&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2616483318%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2616483318&rft_id=info:pmid/&rfr_iscdi=true |