A new induction proof of the Gibbard-Satterthwaite theorem
In this paper, we provide a new induction proof of the Gibbard–Satterthwaite theorem, where the induction argument builds on n = 1 rather than the existing proofs using n = 2. The provided proof is much shorter, and the arguments are very intuitive, which will be helpful in teaching and for beginners in this field.
A new induction proof of the Gibbard-Satterthwaite theorem
In this paper, we provide a new induction proof of the Gibbard–Satterthwaite theorem, where the induction argument builds on n = 1 rather than the existing proofs using n = 2. The provided proof is much shorter, and the arguments are very intuitive, which will be helpful in teaching and for beginners in this field.