A quantitative Gobbard-Satterthwaite theorem without neutrality

DOI10.1007/S00493-014-2979-5zbMath1363.05001OpenAlexW2610212012MaRDI QIDQ343234

Elchanan Mossel, Miklós Z. Rácz

Publication date: 25 November 2016

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-014-2979-5

zbMATH Keywords

Gibbard-Satterthwaite theoremrankings graph

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (4)

Probabilistic view of voting, paradoxes, and manipulation ⋮ The probability of intransitivity in dice and close elections ⋮ Unnamed Item ⋮ Distance restricted manipulation in voting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem
• Positivity improving operators and hypercontractivity
• Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
• The computational difficulty of manipulating an election
• A quantitative Arrow theorem
• Almost all social choice rules are highly manipulable, but a few aren't
• Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
• A Quantitative Version of the Gibbard–Satterthwaite Theorem for Three Alternatives
• Manipulation of Voting Schemes: A General Result
• Assignment of Numbers to Vertices
• A quantitative gibbard-satterthwaite theorem without neutrality
• Testing monotonicity

This page was built for publication: A quantitative Gobbard-Satterthwaite theorem without neutrality