Extension of Arrow's theorem to symmetric sets of tournaments

Arrow’s impossibility theorem [1] shows that the set of acyclic tournaments is not closed to non dictatorial Boolean aggregation. In this paper we extend the notion of aggregation to general tournaments and we show that for tournaments with four vertices or more any proper symmetric (closed to vertex permutations) subset cannot be closed to non dictatorial monotone aggregation and to non neutral aggregation. We also demonstrate a proper subset of tournaments that is closed to parity aggregation for an arbitrarily large number of vertices. This proves a conjecture of Kalai [4] for the non neutral and the non dictatorial and monotone cases and gives a counter example for the general case.

• Type: Journal
• Year: 2007
• Where: DM
• Authors: Eyal Beigman
• Keywords: Dictatorial Boolean Aggregation, Dictatorial Monotone Aggregation, DM 2007, Tournaments