On the ultrafilter representation of coalitionally strategy-proof social choice functions
- 43 Downloads
By means of a simple new characterization of ultrafilters, we elementarily prove, in the case of finitely many alternatives and arbitrarily large societies, that every coalitionally strategy-proof social choice function with at least three alternatives in its range is given by an ultrafilter. This provides an alternate and simple proof of results in Mihara (Soc Choice Welf 17:393–402, 2000). In case there are only two alternatives in the range of a coalitionally strategy-proof social choice function, we describe its structure, supplementing the work of Barberà et al. (Int J Game Theory 41:791–808, 2012).
KeywordsSocial choice functions Coalitional strategy proofness Gibbard–Satterthwaite theorem Ultrafilters
Mathematics Subject Classification91B14
- Aliprantis, C.D., Border, K.C.: Infinite Dimensional Analysis. Springer, Berlin (2006)Google Scholar
- Schmeidler, D., Sonnenschein, H.: Two proofs of the Gibbard–Satterthwaite Theorem on the possibility of a strategy-proof social choice function. In: Gottinger, H.W., Leinfellner, W. (eds.) Decision Theory and Social Ethics, pp. 227–234. Reidel Publishing Company, Dordrecht (1978)CrossRefGoogle Scholar