Classification aggregation: a quantitative impossibility theorem
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913149317283840 |
|---|---|
| author | Filmus, Yuval |
| author_facet | Filmus, Yuval |
| contents | A group of individuals wishes to classify $m$ objects into $n$ categories in such a way that no class is left empty, a condition known as surjectivity. The opinions of the individuals are aggregated separately for each object using an aggregation function that can depend on the object.
Maniquet and Mongin showed that if the aggregation functions are unanimous and the outcome must always be surjective, then the aggregation mechanism is dictatorial. Cailloux et al. showed that the same holds even if unanimity is relaxed to citizen sovereignty (each object can be classified into any category).
We show that similar results hold even if we only require the outcome to be surjective with probability $1-ε$ (with respect to an arbitrary symmetric i.i.d. distribution), provided that the aggregation functions are far from being constant.
On the way, we characterize all aggregation mechanisms whose outcome is always surjective without any assumptions on the aggregation functions.
Our approach uses a general result of Alekseev and Filmus which has wider applicability. We illustrate this by proving a similar impossibility result for aggregating equivalence relations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_17136 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Classification aggregation: a quantitative impossibility theorem Filmus, Yuval Computer Science and Game Theory Combinatorics Probability A group of individuals wishes to classify $m$ objects into $n$ categories in such a way that no class is left empty, a condition known as surjectivity. The opinions of the individuals are aggregated separately for each object using an aggregation function that can depend on the object. Maniquet and Mongin showed that if the aggregation functions are unanimous and the outcome must always be surjective, then the aggregation mechanism is dictatorial. Cailloux et al. showed that the same holds even if unanimity is relaxed to citizen sovereignty (each object can be classified into any category). We show that similar results hold even if we only require the outcome to be surjective with probability $1-ε$ (with respect to an arbitrary symmetric i.i.d. distribution), provided that the aggregation functions are far from being constant. On the way, we characterize all aggregation mechanisms whose outcome is always surjective without any assumptions on the aggregation functions. Our approach uses a general result of Alekseev and Filmus which has wider applicability. We illustrate this by proving a similar impossibility result for aggregating equivalence relations. |
| title | Classification aggregation: a quantitative impossibility theorem |
| topic | Computer Science and Game Theory Combinatorics Probability |
| url | https://arxiv.org/abs/2605.17136 |