Guilbaud's Theorem : An early contribution to judgment aggregation
In 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.
|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/|
When requesting a correction, please mention this item's handle: RePEc:hal:cesptp:halshs-00404185. See general 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: (CCSD)
If references are entirely missing, you can add them using this form.