A tight quantitative version of Arrow's impossibility theorem
From MaRDI portal
Publication:713951
DOI10.4171/JEMS/334zbMath1264.91056arXiv1003.3956MaRDI QIDQ713951
Publication date: 19 October 2012
Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.3956
Related Items (7)
Biased halfspaces, noise sensitivity, and local Chernoff inequalities ⋮ Probabilistic view of voting, paradoxes, and manipulation ⋮ A quantitative Arrow theorem ⋮ Approximately classic judgement aggregation ⋮ The probability of intransitivity in dice and close elections ⋮ Between Arrow and Gibbard-Satterthwaite. A representation theoretic approach ⋮ Hypercontractive inequalities via SOS, and the Frankl--Rödl graph
Cites Work
- Unnamed Item
- Unnamed Item
- The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem
- On the probability of a rational outcome for generalized social welfare functions on three alternatives
- Noise stability of functions with low influences: invariance and optimality
- Positivity improving operators and hypercontractivity
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Inequalities in Fourier analysis
- A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem.
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
- Manipulation of Voting Schemes: A General Result
This page was built for publication: A tight quantitative version of Arrow's impossibility theorem
