Stable matchings with correlated Preferences
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929194863165440 |
|---|---|
| author | Hoffman, Christopher Levy, Avi Mossel, Elchanan |
| author_facet | Hoffman, Christopher Levy, Avi Mossel, Elchanan |
| contents | The stable matching problem has been the subject of intense theoretical and empirical study since the seminal 1962 paper by Gale and Shapley. The number of stable matchings for different systems of preferences has been studied in many contexts, going back to Donald Knuth in the 1970s. In this paper, we consider a family of distributions defined by the Mallows permutations and show that with high probability the number of stable matchings for these preferences is exponential in the number of people. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_14813 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Stable matchings with correlated Preferences Hoffman, Christopher Levy, Avi Mossel, Elchanan Probability 91B68 (Primary) 60C05 (Secondary) The stable matching problem has been the subject of intense theoretical and empirical study since the seminal 1962 paper by Gale and Shapley. The number of stable matchings for different systems of preferences has been studied in many contexts, going back to Donald Knuth in the 1970s. In this paper, we consider a family of distributions defined by the Mallows permutations and show that with high probability the number of stable matchings for these preferences is exponential in the number of people. |
| title | Stable matchings with correlated Preferences |
| topic | Probability 91B68 (Primary) 60C05 (Secondary) |
| url | https://arxiv.org/abs/2312.14813 |