Putting Fair Division on the Map
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916721613340672 |
|---|---|
| author | Böhm, Paula Bredereck, Robert Gölz, Paul Kaczmarczyk, Andrzej Szufa, Stanisław |
| author_facet | Böhm, Paula Bredereck, Robert Gölz, Paul Kaczmarczyk, Andrzej Szufa, Stanisław |
| contents | The fair division of indivisible goods is not only a subject of theoretical research, but also an important problem in practice, with solutions being offered on several online platforms. Little is known, however, about the characteristics of real-world allocation instances and how they compare to synthetic instances. Using dimensionality reduction, we compute a map of allocation instances: a 2-dimensional embedding such that an instance's location on the map is predictive of the instance's origin and other key instance features. Because the axes of this map closely align with the utility matrix's two largest singular values, we define a second, explicit map, which we theoretically characterize. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_20161 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Putting Fair Division on the Map Böhm, Paula Bredereck, Robert Gölz, Paul Kaczmarczyk, Andrzej Szufa, Stanisław Computer Science and Game Theory The fair division of indivisible goods is not only a subject of theoretical research, but also an important problem in practice, with solutions being offered on several online platforms. Little is known, however, about the characteristics of real-world allocation instances and how they compare to synthetic instances. Using dimensionality reduction, we compute a map of allocation instances: a 2-dimensional embedding such that an instance's location on the map is predictive of the instance's origin and other key instance features. Because the axes of this map closely align with the utility matrix's two largest singular values, we define a second, explicit map, which we theoretically characterize. |
| title | Putting Fair Division on the Map |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2504.20161 |