On Optimal Tradeoffs between EFX and Nash Welfare
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916090600226816 |
|---|---|
| author | Feldman, Michal Mauras, Simon Ponitka, Tomasz |
| author_facet | Feldman, Michal Mauras, Simon Ponitka, Tomasz |
| contents | A major problem in fair division is how to allocate a set of indivisible resources among agents fairly and efficiently. The goal of this work is to characterize the tradeoffs between two well-studied measures of fairness and efficiency -- envy freeness up to any item (EFX) for fairness, and Nash welfare for efficiency -- by saying, for given constants $α$ and $β$, whether there exists an $α$-EFX allocation that guarantees a $β$-fraction of the maximum Nash welfare ($β$-MNW). For additive valuations, we show that for any $α\in [0,1]$, there exists a partial allocation that is $α$-EFX and $\frac{1}{α+1}$-MNW, and this tradeoff is tight (for any $α$). We also show that for $α\in[0,φ-1 \approx 0.618]$ these partial allocations can be turned into complete allocations where all items are assigned. Furthermore, for any $α\in [0, 1/2]$, we show that the tight tradeoff of $α$-EFX and $\frac{1}{α+1}$-MNW with complete allocations holds for the more general setting of subadditive valuations. Our results improve upon the current state of the art, for both additive and subadditive valuations, and match the best-known approximations of EFX under complete allocations, regardless of Nash welfare guarantees. Notably, our constructions for additive valuations also provide EF1 and constant approximations for maximin share guarantees. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2302_09633 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | On Optimal Tradeoffs between EFX and Nash Welfare Feldman, Michal Mauras, Simon Ponitka, Tomasz Computer Science and Game Theory A major problem in fair division is how to allocate a set of indivisible resources among agents fairly and efficiently. The goal of this work is to characterize the tradeoffs between two well-studied measures of fairness and efficiency -- envy freeness up to any item (EFX) for fairness, and Nash welfare for efficiency -- by saying, for given constants $α$ and $β$, whether there exists an $α$-EFX allocation that guarantees a $β$-fraction of the maximum Nash welfare ($β$-MNW). For additive valuations, we show that for any $α\in [0,1]$, there exists a partial allocation that is $α$-EFX and $\frac{1}{α+1}$-MNW, and this tradeoff is tight (for any $α$). We also show that for $α\in[0,φ-1 \approx 0.618]$ these partial allocations can be turned into complete allocations where all items are assigned. Furthermore, for any $α\in [0, 1/2]$, we show that the tight tradeoff of $α$-EFX and $\frac{1}{α+1}$-MNW with complete allocations holds for the more general setting of subadditive valuations. Our results improve upon the current state of the art, for both additive and subadditive valuations, and match the best-known approximations of EFX under complete allocations, regardless of Nash welfare guarantees. Notably, our constructions for additive valuations also provide EF1 and constant approximations for maximin share guarantees. |
| title | On Optimal Tradeoffs between EFX and Nash Welfare |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2302.09633 |