Social Decision Functions and Strongly Decisive Sets
Several recent papers have developed partial or complete characterization of classes of social decision functions in terms of constructs based upon the associated collections of decisive sets. Hansson (1976) interpreted Arrow’s impossibility theorem in terms of the associated ultrafilter of decisive sets. Brown (1973) extended this correspondence to the case of acyclic choice functions and prefilters. To deal with the multiplicity of social decision functions having the same collection of decisive sets, Brown restricted the class of social decision functions while Ferejohn and Fishburn (1979) and Blau and Brown (1980) added structure to the collections of decisive sets, and thereby obtained a characterization of certain social decision functions.
- DOI
- 10.2307/2296890
- Volume
- 48 (2)
- Pages
- 343
- Export
- BibTeX
- Sources
- openalex crossref