Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.09288 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916849576312832 |
|---|---|
| author | Kaviani, Alireza Keshavarz, Alireza Seddighin, Masoud Shahrezaei, AmirMohammad |
| author_facet | Kaviani, Alireza Keshavarz, Alireza Seddighin, Masoud Shahrezaei, AmirMohammad |
| contents | In recent years, a new line of work in fair allocation has focused on EFX allocations for \((p, q)\)-bounded valuations, where each good is relevant to at most \(p\) agents, and any pair of agents share at most \(q\) relevant goods. For the case \(p = 2\) and \(q = \infty\), such instances can be equivalently represented as multigraphs whose vertices are the agents and whose edges represent goods, each edge incident to exactly the one or two agents for whom the good is relevant. A recent result of \citet{amanatidis2024pushing} shows that for additive $(2,\infty)$ bounded valuations, a \((\nicefrac{2}{3})\)-EFX allocation always exists. In this paper, we improve this bound by proving the existence of a \((\nicefrac{1}{\sqrt{2}})\)-\(\efx\) allocation for additive \((2,\infty)\)-bounded valuations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_09288 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Improved Approximate EFX Guarantees for Multigraphs Kaviani, Alireza Keshavarz, Alireza Seddighin, Masoud Shahrezaei, AmirMohammad Computer Science and Game Theory In recent years, a new line of work in fair allocation has focused on EFX allocations for \((p, q)\)-bounded valuations, where each good is relevant to at most \(p\) agents, and any pair of agents share at most \(q\) relevant goods. For the case \(p = 2\) and \(q = \infty\), such instances can be equivalently represented as multigraphs whose vertices are the agents and whose edges represent goods, each edge incident to exactly the one or two agents for whom the good is relevant. A recent result of \citet{amanatidis2024pushing} shows that for additive $(2,\infty)$ bounded valuations, a \((\nicefrac{2}{3})\)-EFX allocation always exists. In this paper, we improve this bound by proving the existence of a \((\nicefrac{1}{\sqrt{2}})\)-\(\efx\) allocation for additive \((2,\infty)\)-bounded valuations. |
| title | Improved Approximate EFX Guarantees for Multigraphs |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2506.09288 |