PublicationsPapers

Dokow and Holzman determined which predicates over $\{0, 1\}$ satisfy an analog 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–Holzman and Szegedy–Xu to the setting of Mossel.
As an application, we determine all aggregators for all symmetric predicates over $\{0,1\}$.

A formalization of the main results in Lean can be found here.