Aggregation mechanisms for surjective classifications are nearly dictatorial with high probability unless functions are nearly constant, with a full characterization of always-surjective mechanisms.
Boolean functions whose F ourier transform is concentrated on the first two levels
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Classification aggregation: a quantitative impossibility theorem
Aggregation mechanisms for surjective classifications are nearly dictatorial with high probability unless functions are nearly constant, with a full characterization of always-surjective mechanisms.