Maximin Share Guarantees for Few Agents with Subadditive Valuations
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929702598344704 |
|---|---|
| author | Christodoulou, George Christoforidis, Vasilis Mastrakoulis, Symeon Sgouritsa, Alkmini |
| author_facet | Christodoulou, George Christoforidis, Vasilis Mastrakoulis, Symeon Sgouritsa, Alkmini |
| contents | We study the problem of fairly allocating a set of indivisible items among a set of agents. We consider the notion of (approximate) maximin share (MMS) and we provide an improved lower bound of $1/2$ (which is tight) for the case of subadditive valuations when the number of agents is at most four. We also provide a tight lower bound for the case of multiple agents, when they are equipped with one of two possible types of valuations. Moreover, we propose a new model that extends previously studied models in the area of fair division, which will hopefully give rise to further research. We demonstrate the usefulness of this model by employing it as a technical tool to derive our main result, and we provide a thorough analysis for this model for the case of three agents. Finally, we provide an improved impossibility result for the case of three submodular agents. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_05141 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Maximin Share Guarantees for Few Agents with Subadditive Valuations Christodoulou, George Christoforidis, Vasilis Mastrakoulis, Symeon Sgouritsa, Alkmini Computer Science and Game Theory We study the problem of fairly allocating a set of indivisible items among a set of agents. We consider the notion of (approximate) maximin share (MMS) and we provide an improved lower bound of $1/2$ (which is tight) for the case of subadditive valuations when the number of agents is at most four. We also provide a tight lower bound for the case of multiple agents, when they are equipped with one of two possible types of valuations. Moreover, we propose a new model that extends previously studied models in the area of fair division, which will hopefully give rise to further research. We demonstrate the usefulness of this model by employing it as a technical tool to derive our main result, and we provide a thorough analysis for this model for the case of three agents. Finally, we provide an improved impossibility result for the case of three submodular agents. |
| title | Maximin Share Guarantees for Few Agents with Subadditive Valuations |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2502.05141 |