De Condorcet à Arrow via Guilbaud, Nakamura et les "jeux simples"

Mathématiques et sciences humaines. Mathematics and social sciences

Monjardet, Bernard¹ 

关键词: simple game;    aggregation of preferences;    Arrow's theorem;    Guilbaud's theorem;    Nakamura's theorem;    ultrafilter;    effet Condorcet;   

DOI  :  10.4000/msh.2917

学科分类：数学（综合）

来源: College de France * Ecole des Hautes Etudes en Sciences Sociales (E H E S S)

【 摘 要 】

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". We begin by recalling the Condorcet majority rules and why they fail: the so called "effet Condorcet". These rules are examples of preference aggregation functions defined by a simple game, and then following Guilbaud's approach, we seek if in the class of all these functions we can find some functions avoiding this problem. The rather negative answer is given by the Guilbaud and Nakamura theorems. Taking then an axiomatic approach we show that some independent and Paretian preference aggregation functions avoiding the "effet Condorcet" are defined by a simple game. So the previous results allow to get several Arrovian theorems and finally Arrow's theorem. In the last section we give some historical and bibliographical comments on these results and on several developments showing essentially the robustness of Arrow's theorem.

【 授权许可】

Unknown