A Fourier-theoretic perspective on the Condorcet paradox and arrow's theorem

Advances in Applied Mathematics

Volumn 29, Issue 3, 2002, Pages 412-426

  Kalai, Gil ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036821398     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-8858(02)00023-4     Document Type: Article

References (19)

1. K. Arrow, A difficulty in the theory of social welfare, J. Political Economy 58 (1950) 328-346.
2. Y.M. Baryshnikov, Unifying impossibility theorems: a topological approach, Adv. in Appl. Math. 14 (1993) 404-415.
3. C. Bell, A random voting graph almost surely has a Hamiltonian cycle when the number of alternatives is large, Econometrica 49 (1981) 1597-1603.
4. J. Bourgain, On the distribution of the Fourier spectrum of Boolean functions, Israel J. Math. 131 (2002) 269-276.
5. G. Chichilinsky, Social choice and the topology of the spaces of preferences, Adv. in Math. 37 (1980) 165-176.
6. P. Fishburn, The Theory of Social Choice, Princeton Univ. Press, 1973.
7. E. Friedgut, G. Kalai, A. Naor, Boolean functions whose Fourier transform is concentrated on the first two levels, Adv. in Appl. Math. (2001), this volume.
8. D. Foata, D. Zeilberger, Graphical major indices, J. Comput. Appl. Math. 68 (1996) 79-101.
9. J. Geanakoplos, Three brief proofs of Arrow's impossibility theorem, Cowels Foundation Discussion Papers number 1123R, Yale University, 1997, http://ideas.uqam.ca/ideas/data/Papers/cwlcwldppl123R.html.
10. W.V. Gehrlein, Condorcet's paradox and the Condorcet efficiency of voting rules, Math. Japon. 45 (1997) 173-199.
11. 1-eO, Acta Math. 182 (1999) 105-142.
12. J. Kahn, G. Kalai, N. Linial, The influence of variables on Boolean functions, in: Proc. 29th Ann. Symp. on Foundations of Comp. Sci., 1988, pp. 68-80.
13. V. Levenstein, Krawchouk Polynomials and universal bounds on codes and designs in Hamming spaces, IEEE Trans. Inform. Theory 41 (5) (September 1995) 1303-1321.
14. M. Parnas, D. Ron, A. Samorodnitsky, Proclaiming dictators and juntas or testing Boolean formulae, in: Approximation, Randomization, and Combinatorial Optimization, Berkeley, CA, 2001, in: Lecture Notes in Comput. Sci., Vol. 2129, Springer-Verlag, Berlin, 2001, pp. 273-284.
15. B. Peleg, Game Theoretic Analysis of Voting in Committees, in: Econom. Soc. Monographs Pure Theory, Vol. 7, Cambridge Univ. Press, Cambridge, 1984.
16. D. Saari, Informational geometry of social choice, Soc. Choice Welf. 14 (1997) 211-232.
17. A. Sen, Social choice theory, Chapter 22, in: Arrow and Intriligator, in: Handbook of Math. Econom., Vol. III, North-Holland, Amsterdam, 1986, pp. 1073-1182.
18. M. Talagrand, How much are increasing sets positively correlated? Combinatorica 16 (1996) 243-258.
19. D. White, S.G. Williamson, Combinatorial and multilinear aspects of sign-balanced posets, Linear and Multilinear Algebra 49 (2001) 169-181.