Guilbaud's 1952 theorem on the logical problem of aggregation
AbstractIn a paper published in 1952, shortly after publication of Arrow's celebrated impossibility result, the French mathematicien Georges-Théodule Guilbaud has obtained a dictatorship result for the logical problem of aggregation, thus anticipating the literature on abstract aggregation theory and judgment aggregation. We reconstruct the proof of Guilbaud's theorem, which is also of technical interest, because it can be seen as the first use of ultrafilters in social choice theory.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by HAL in its series Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) with number halshs-00504959.
Date of creation: Jun 2010
Date of revision:
Note: View the original document on HAL open archive server: http://halshs.archives-ouvertes.fr/halshs-00504959
Contact details of provider:
Web page: http://hal.archives-ouvertes.fr/
Aggregation ; judgment aggregation ; logical connectives ; simple game ; ultrafilter;
Other versions of this item:
- Daniel Eckert & Bernard Monjardet, 2010. "Guilbaud's 1952 theorem on the logical problem of aggregation," Documents de travail du Centre d'Economie de la Sorbonne 10056, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
- NEP-ALL-2010-07-31 (All new papers)
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CCSD).
If references are entirely missing, you can add them using this form.