暂无分享,去创建一个
[1] J. Rotman. An Introduction to the Theory of Groups , 1965 .
[2] S. Banach. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales , 1922 .
[3] Elchanan Mossel,et al. A quantitative Arrow theorem , 2009, 0903.2574.
[4] Frank Feys,et al. Fourier Analysis for Social Choice , 2015 .
[5] Assaf Naor,et al. Boolean functions whose Fourier transform is concentrated on the first two levels , 2002, Adv. Appl. Math..
[6] Salvador Barberà,et al. Pivotal voters: A new proof of arrow's theorem , 1980 .
[7] L. S. Pontri︠a︡gin,et al. Basic concepts and constructions dimension theory , 1990 .
[8] Gil Kalai,et al. A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem , 2002, Adv. Appl. Math..
[9] K. Arrow. Social Choice and Individual Values , 1951 .
[10] J. H. Blau,et al. A Direct Proof of Arrow's Theorem , 1972 .
[11] M. Kamien,et al. The paradox of voting: probability calculations. , 1968, Behavioral science.
[12] Dieter Sondermann,et al. Arrow's theorem, many agents, and invisible dictators☆ , 1972 .
[13] J. Geanakoplos. Three brief proofs of Arrow’s Impossibility Theorem , 2001 .
[14] Ryan O'Donnell,et al. Analysis of Boolean Functions , 2014, ArXiv.
[15] P. Reny. Arrow’s theorem and the Gibbard-Satterthwaite theorem: a unified approach , 2001 .
[16] J. Nash. Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.
[17] Claudia Landi,et al. The natural pseudo-distance as a quotient pseudo-metric, and applications , 2015 .
[18] A. Gibbard. Manipulation of Voting Schemes: A General Result , 1973 .
[19] Vittorino Pata,et al. Fixed Point Theorems and Applications , 2019, UNITEXT.