Guilbaud's Theorem: an early contribution to judgment aggregation

Daniel Eckert () and Bernard Monjardet

Documents de travail du Centre d'Economie de la Sorbonne from Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne

Abstract: In a paper published in 1952, the French matematician 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; simple game; ultrafilter (search for similar items in EconPapers)
JEL-codes: D71 (search for similar items in EconPapers)
Pages: 21 pages
Date: 2009-06
New Economics Papers: this item is included in nep-cdm, nep-his and nep-hpe
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
ftp://mse.univ-paris1.fr/pub/mse/CES2009/09047.pdf (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:mse:cesdoc:09047

Access Statistics for this paper

More papers in Documents de travail du Centre d'Economie de la Sorbonne from Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne Contact information at EDIRC.
Bibliographic data for series maintained by Lucie Label ().