Daniel Eckert () (Institute of Public Economics - Universität of Graz) Bernard Monjardet () (CES - Centre d'économie de la Sorbonne - CNRS : UMR8174 - Université Panthéon-Sorbonne - Paris I)
Additional information is available for the following
registered author(s):
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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Length: Date of creation: Jun 2009 Date of revision: Handle: RePEc:hal:cesptp:halshs-00404185_v1
Note: View the original document on HAL open archive server: http://halshs.archives-ouvertes.fr/halshs-00404185/en/ Contact details of provider: Web page: http://hal.archives-ouvertes.fr/
For technical questions regarding this item, or to correct its listing, contact: (CCSD).