Probabilistic view of voting, paradoxes, and manipulation
From MaRDI portal
Publication:5081545
DOI10.1090/BULL/1751zbMATH Open1492.91118OpenAlexW4212803044MaRDI QIDQ5081545FDOQ5081545
Authors: Elchanan Mossel 
Publication date: 15 June 2022
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/bull/1751
Recommendations
Cites Work
- Social choice and individual values
- Inequalities in Fourier analysis
- The free Markoff field
- Logarithmic Sobolev Inequalities
- Analysis of Boolean Functions
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Aggregating sets of judgments: two impossibility results compared. With a comment by Isaac Levi
- The influence of variables in product spaces
- Geometric influences
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Gaussian bounds for noise correlation of functions
- Manipulation of Voting Schemes: A General Result
- Mathematical Properties of the Banzhaf Power Index
- Noise sensitivity of Boolean functions and applications to percolation
- Noise stability of functions with low influences: invariance and optimality
- An isoperimetric inequality on the discrete cube and an elementary proof of the isoperimetric inequality in Gauss space
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
- Maximally stable Gaussian partitions with discrete applications
- A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem.
- Robust optimality of Gaussian noise stability
- Geometric bounds on the Ornstein-Uhlenbeck velocity process
- Double bubbles in Gauss space and spheres
- A two-sided estimate for the Gaussian noise stability deficit
- Three candidate plurality is stablest for small correlations
- Majority is stablest: discrete and SoS
- Majority is stablest: discrete and SoS
- Positivity improving operators and hypercontractivity
- A quantitative Arrow theorem
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
- A Quantitative Version of the Gibbard–Satterthwaite Theorem for Three Alternatives
- A quantitative Gobbard-Satterthwaite theorem without neutrality
- The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem
- A quantitative gibbard-satterthwaite theorem without neutrality
- Condorcet’s Paradox
- On the noise sensitivity of monotone functions
- Boolean functions whose Fourier transform is concentrated on the first two levels.
- On reverse hypercontractivity
- Between Arrow and Gibbard-Satterthwaite. A representation theoretic approach
- A tight quantitative version of Arrow's impossibility theorem
- A Random Voting Graph Almost Surely has a Hamiltonian Cycle when the Number of Alternatives is Large
- Social Indeterminacy
- Approximately classic judgement aggregation
- A multidimensional version of noise stability
- Ensembles \(\Lambda(p)\) dans le dual de \(D^\infty\)
- On some extensions of the FKN theorem
- Gaussian noise sensitivity and Fourier tails
- Gaussian bounds for noise correlation of resilient functions
- On Non-Interactive Simulation of Binary Random Variables
- Remarks on Gaussian noise stability, Brascamp-Lieb and Slepian inequalities
- AND testing and robust judgement aggregation
Cited In (7)
This page was built for publication: Probabilistic view of voting, paradoxes, and manipulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5081545)
