Guilbaud's Theorem : An early contribution to judgment aggregation
AbstractIn a paper published in 1952, the French mathematician Georges-Théodule Guilbaud has generalized Arrow's impossibility result to 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 Post-Print with number halshs-00404185.
Date of creation: Jun 2009
Date of revision:
Note: View the original document on HAL open archive server: http://halshs.archives-ouvertes.fr/halshs-00404185
Contact details of provider:
Web page: http://hal.archives-ouvertes.fr/
Arrow's theorem; aggregation rule; judgment aggregation; logical connexions; simple game; ultrafilter.;
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.