A quantitative Arrow theorem
From MaRDI portal
Publication:1930856
DOI10.1007/s00440-011-0362-7zbMath1269.60010arXiv0903.2574OpenAlexW2047906881MaRDI QIDQ1930856
Publication date: 14 January 2013
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.2574
Voting theory (91B12) Combinatorial probability (60C05) Group preferences (91B10) Social choice (91B14)
Related Items
Quantum reverse hypercontractivity, On reverse hypercontractivity, A quantitative Gobbard-Satterthwaite theorem without neutrality, Probabilistic view of voting, paradoxes, and manipulation, Quantum Talagrand, KKL and Friedgut's theorems and the learnability of quantum Boolean functions, Approximately classic judgement aggregation, The probability of intransitivity in dice and close elections, Unnamed Item, Between Arrow and Gibbard-Satterthwaite. A representation theoretic approach, Quantitative relation between noise sensitivity and influences, On the probability of a rational outcome for generalized social welfare functions on three alternatives, Gaussian bounds for noise correlation of resilient functions, Hypercontractive inequalities via SOS, and the Frankl--Rödl graph, Robust dimension free isoperimetry in Gaussian space
Cites Work
- The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem
- A tight quantitative version of Arrow's impossibility 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
- Limit theorems for polylinear forms
- Positivity improving operators and hypercontractivity
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem.
- Gaussian bounds for noise correlation of functions
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
- Conditional hardness for approximate coloring
- Property testing and its connection to learning and approximation
- Geometric bounds on the Ornstein-Uhlenbeck velocity process
- Manipulation of Voting Schemes: A General Result
- Robust Characterizations of Polynomials with Applications to Program Testing
