Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.00342 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916230478168064 |
|---|---|
| author | Kamiyama, Naoyuki |
| author_facet | Kamiyama, Naoyuki |
| contents | In this paper, we consider a many-to-one matching market where ties in the preferences of agents are allowed. For this market with capacity constraints, Bonifacio, Juarez, Neme, and Oviedo proved some relationship between the set of stable matchings and the core. In this paper, we consider a matroid constraint that is a generalization of a capacity constraint. We prove that the results proved by Bonifacio, Juarez, Neme, and Oviedo can be generalized to this setting. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_00342 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Set of Stable Matchings and the Core in a Matching Market with Ties and Matroid Constraints Kamiyama, Naoyuki Computer Science and Game Theory In this paper, we consider a many-to-one matching market where ties in the preferences of agents are allowed. For this market with capacity constraints, Bonifacio, Juarez, Neme, and Oviedo proved some relationship between the set of stable matchings and the core. In this paper, we consider a matroid constraint that is a generalization of a capacity constraint. We prove that the results proved by Bonifacio, Juarez, Neme, and Oviedo can be generalized to this setting. |
| title | The Set of Stable Matchings and the Core in a Matching Market with Ties and Matroid Constraints |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2405.00342 |