Impossibility Theorems and the Universal Algebraic Toolkit

by   Mario Szegedy, et al.

We elucidate a close connection between the Theory of Judgment Aggregation (more generally, Evaluation Aggregation), and a relatively young but rapidly growing field of universal algebra, that was primarily developed to investigate constraint satisfaction problems. Our connection yields a full classification of non-binary evaluations into possibility and impossibility domains both under the idempotent and the supportive conditions. Prior to the current result E. Dokow and R. Holzman nearly classified non-binary evaluations in the supportive case, by combinatorial means. The algebraic approach gives us new insights to the easier binary case as well, which had been fully classified by the above authors. Our algebraic view lets us put forth a suggestion about a strengthening of the Non-dictatorship criterion, that helps us avoid "outliers" like the affine subspace. Finally, we give upper bounds on the complexity of computing if a domain is impossible or not (to our best knowledge no finite time bounds were given earlier).


page 1

page 2

page 3

page 4


The Algebraic View of Computation

We argue that computation is an abstract algebraic concept, and a comput...

Network satisfaction for symmetric relation algebras with a flexible atom

Robin Hirsch posed in 1996 the Really Big Complexity Problem: classify t...

Constraint Satisfaction Problems over Finite Structures

We initiate a systematic study of the computational complexity of the Co...

Component twin-width as a parameter for BINARY-CSP and its semiring generalisations

We investigate the fine-grained and the parameterized complexity of seve...

Finite-state Strategies in Delay Games

What is a finite-state strategy in a delay game? We answer this surprisi...

Please sign up or login with your details

Forgot password? Click here to reset