Preference Aggregation Functions and Arrows Theorem
The aim of this paper is to present Arrow's theorem and more generally the common framework of many results which can be called "Arrovian theorems". One begins by recalling the Condorcet majority rules, and why they fail: the "effet Condorcet". These rules are examples of preference aggregation functions defined by a simple game, and then one seeks if in the class of all these functions one can find functions avoiding this problem.