Probabilistic Analysis of Stable Matching in Large Markets with Siblings
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912199749926912 |
|---|---|
| author | Sun, Zhaohong Yokoyama, Tomohiko Yokoo, Makoto |
| author_facet | Sun, Zhaohong Yokoyama, Tomohiko Yokoo, Makoto |
| contents | We study a practical centralized matching problem which assigns children to daycare centers. The collective preferences of siblings from the same family introduce complementarities, which can lead to the absence of stable matchings, as observed in the hospital-doctor matching problems involving couples. Intriguingly, stable matchings are consistently observed in real-world daycare markets, despite the prevalence of sibling applicants.
We conduct a probabilistic analysis of large random markets to examine the existence of stable matchings in such markets. Specifically, we examine scenarios where daycare centers have similar priorities over children, a common characteristic in real-world markets. Our analysis reveals that as the market size approaches infinity, the likelihood of stable matchings existing converges to 1.
To facilitate our exploration, we refine an existing heuristic algorithm to address a more rigorous stability concept, as the original one may fail to meet this criterion. Through extensive experiments on both real-world and synthetic datasets, we demonstrate the effectiveness of our revised algorithm in identifying stable matchings, particularly when daycare priorities exhibit high similarity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_13043 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Probabilistic Analysis of Stable Matching in Large Markets with Siblings Sun, Zhaohong Yokoyama, Tomohiko Yokoo, Makoto Computer Science and Game Theory 91B68 F.2; I.2 We study a practical centralized matching problem which assigns children to daycare centers. The collective preferences of siblings from the same family introduce complementarities, which can lead to the absence of stable matchings, as observed in the hospital-doctor matching problems involving couples. Intriguingly, stable matchings are consistently observed in real-world daycare markets, despite the prevalence of sibling applicants. We conduct a probabilistic analysis of large random markets to examine the existence of stable matchings in such markets. Specifically, we examine scenarios where daycare centers have similar priorities over children, a common characteristic in real-world markets. Our analysis reveals that as the market size approaches infinity, the likelihood of stable matchings existing converges to 1. To facilitate our exploration, we refine an existing heuristic algorithm to address a more rigorous stability concept, as the original one may fail to meet this criterion. Through extensive experiments on both real-world and synthetic datasets, we demonstrate the effectiveness of our revised algorithm in identifying stable matchings, particularly when daycare priorities exhibit high similarity. |
| title | Probabilistic Analysis of Stable Matching in Large Markets with Siblings |
| topic | Computer Science and Game Theory 91B68 F.2; I.2 |
| url | https://arxiv.org/abs/2501.13043 |