A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem.
From MaRDI portal
Publication:1866178
DOI10.1016/S0196-8858(02)00023-4zbMath1038.91027WikidataQ62111469 ScholiaQ62111469MaRDI QIDQ1866178
Publication date: 3 April 2003
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Condorcet paradoxBoolean functionsFourier coefficientsArrow's theoremrational social choice functions
Related Items (32)
Biased halfspaces, noise sensitivity, and local Chernoff inequalities ⋮ In praise of homomorphisms ⋮ On reverse hypercontractivity ⋮ Gaussian bounds for noise correlation of functions ⋮ Standard simplices and pluralities are not the most noise stable ⋮ Gaussian noise sensitivity and Fourier tails ⋮ Game theoretic interaction and decision: a quantum analysis ⋮ Probabilistic view of voting, paradoxes, and manipulation ⋮ Complete characterization of functions satisfying the conditions of Arrow's theorem ⋮ A quantitative Arrow theorem ⋮ On Quine on Arrow ⋮ Approximately classic judgement aggregation ⋮ The probability of intransitivity in dice and close elections ⋮ Unnamed Item ⋮ Colouring, constraint satisfaction, and complexity ⋮ A structure theorem for almost low-degree functions on the slice ⋮ Between Arrow and Gibbard-Satterthwaite. A representation theoretic approach ⋮ Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions ⋮ A law of large numbers for weighted plurality ⋮ A quasi-stability result for dictatorships in \(S_n\) ⋮ Bases and linear transforms of TU-games and cooperation systems ⋮ Maximally stable Gaussian partitions with discrete applications ⋮ 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 ⋮ On the structure of Boolean functions with small spectral norm ⋮ Robust optimality of Gaussian noise stability ⋮ A tight quantitative version of Arrow's impossibility theorem ⋮ Comments on: ``Remarkable polyhedra related to set functions, games and capacities ⋮ Gaussian bounds for noise correlation of resilient functions ⋮ Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity ⋮ The Quest for Strong Inapproximability Results with Perfect Completeness ⋮ Boolean functions whose Fourier transform is concentrated on the first two levels.
Cites Work
- Social choice and the topology of spaces of preferences
- Unifying impossibility theorems: A topological approach
- Informational geometry of social choice
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- On the distribution of the Fourier spectrum of Boolean functions
- Graphical major indices
- How much are increasing sets positively correlated?
- Research problem: combinatorial and multilinear aspects of sign-balanced posets
- A Random Voting Graph Almost Surely has a Hamiltonian Cycle when the Number of Alternatives is Large
- Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem.
