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 Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne in its series Documents de travail du Centre d'Economie de la Sorbonne with number 10056.
Length: 24 pages
Date of creation: Jun 2010
Date of revision:
Contact details of provider:
Postal: 106-112 boulevard de l'Hôpital 75 647 PARIS CEDEX 13
Phone: + 33 44 07 81 00
Fax: + 33 1 44 07 83 01
Web page: http://centredeconomiesorbonne.univ-paris1.fr/
More information through EDIRC
Aggregation; judgment aggregation; logical connectives; simple game; ultrafilter.;
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-07-31 (All new papers)
- NEP-CDM-2010-07-31 (Collective Decision-Making)
- NEP-HIS-2010-07-31 (Business, Economic & Financial History)
- NEP-HPE-2010-07-31 (History & Philosophy of Economics)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lucie Label).
If references are entirely missing, you can add them using this form.