论文信息 - Another direct proof of the Gibbard–Satterthwaite Theorem - 字舞流文

Another direct proof of the Gibbard–Satterthwaite Theorem

Abstract This paper provides a new and direct proof of the Gibbard–Satterthwaite Theorem based on induction on the number of individuals.

[1] B. Peleg,et al. Strategy-proof voting schemes with continuous preferences , 1990 .

[2] David Schmeidler,et al. Two Proofs of the Gibbard-Satterthwaite Theorem on the Possibility of a Strategy-Proof Social Choice Function , 1978 .

[3] P. Reny. Arrow’s theorem and the Gibbard-Satterthwaite theorem: a unified approach , 2001 .

[4] J. Benoît,et al. The Gibbard-Satterthwaite theorem: a simple proof , 2000 .

[5] A. Gibbard. Manipulation of Schemes That Mix Voting with Chance , 1977 .

[6] M. Satterthwaite. Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions , 1975 .

[7] Salvador Barberà,et al. Strategy-Proofness and Pivotal Voters: A Direct Proof of the Gibbard-Satterthwaite Theorem , 1983 .

[8] A. Gibbard. Manipulation of Voting Schemes: A General Result , 1973 .