  We generalize the Arrow's impossibility theorem--a key result in social
choice theory--to the setting where the arity $k$ of the relation under
consideration is greater than $2$. Some special but natural properties of
$k$-ary relations are considered, as well as an analogue for such $k$-ary
relations of Endriss and Grandi's result on graph aggregation is proved.
