Guilbaud's Theorem: An early contribution to judgment aggregation

Daniel Eckert () and Bernard Monjardet

Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) from HAL

Abstract: 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.

Keywords: Arrow's theorem; aggregation rule; judgment aggregation; logical connexions; ultrafilter.; simple game; ultrafilter; Agrégation des jugements; jeu simple; liaisons logiques; règle d'agrégation; théorème d'Arrow; ultrafiltre. (search for similar items in EconPapers)
Date: 2009-06
Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-00404185v1
References: Add references at CitEc
Citations:

Published in 2009

Downloads: (external link)
https://shs.hal.science/halshs-00404185v1/document (application/pdf)

Related works:
Working Paper: Guilbaud's Theorem: An early contribution to judgment aggregation (2009)
Working Paper: Guilbaud's Theorem: an early contribution to judgment aggregation (2009)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:cesptp:halshs-00404185

Access Statistics for this paper

More papers in Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) from HAL
Bibliographic data for series maintained by CCSD ().