Aggregation of Evaluations without Unanimity
SIAM Journal on Discrete Mathematics · 30.06.2026 · 40 (2) · 652-674
DOI: 10.1137/25m1748901 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Discrete Mathematics, online erschienen am 30.04.2026. Verfasst von Yuval Filmus. Die Arbeit nennt 42 Literaturangaben. Gefördert von: Israel Science Foundation.
Abstract (Originalsprache)
Dokow and Holzman determined which predicates over [Formula: see text] satisfy an analogue of Arrow’s theorem: all unanimous aggregators are dictatorial. Szegedy and Xu, extending earlier work of Dokow and Holzman, extended this to predicates over arbitrary finite alphabets. Mossel extended Arrow’s theorem in an orthogonal direction, determining all aggregators without the assumption of unanimity. We bring together both threads of research by extending the results of Dokow and Holzman and of Szegedy and Xu to the setting of Mossel. As an application, we determine, for each symmetric predicate over [Formula: see text], all of its aggregators.
Förderung
- Israel Science Foundation
Zitieren
APA
Filmus, Y. (2026). Aggregation of Evaluations without Unanimity. SIAM Journal on Discrete Mathematics, 40(2), 652-674. https://doi.org/10.1137/25m1748901
Vancouver
Filmus Y. Aggregation of Evaluations without Unanimity. SIAM Journal on Discrete Mathematics. 2026;40(2):652-674. doi:10.1137/25m1748901
BibTeX
@article{Filmus2026,
author = {Filmus, Yuval},
title = {Aggregation of Evaluations without Unanimity},
journal = {SIAM Journal on Discrete Mathematics},
year = {2026},
volume = {40},
number = {2},
pages = {652--674},
doi = {10.1137/25m1748901}
}
EUVIMED