Quantitative impossibility theorems

Kalai famously proved a quantitative version of Arrow’s impossibility theorem. We discuss a general framework which can be used to prove such results, illustrating it with quantitative impossibility theorems for classification aggregation and for aggregations of equivalence relations. Based in part on joint work with Yaroslav Alekseev (Technion).