Mediators Enable Truthful Voting
The Gibbard-Satterthwaite Theorem asserts the impossibility of designing a non-dictatorial voting rule in which truth-telling always constitutes a Nash equilibrium. We show that in voting games of complete information where a mediator is on hand, this troubling impossibility result can be alleviated. Indeed, we characterize families of voting rules where, given a mediator, truthful preference revelation is always in strong equilibrium. In particular, we observe that the family of feasible elimination procedures has the foregoing property.
(This abstract was borrowed from another version of this item.)
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Peleg,Bezalel, 2008.
"Game Theoretic Analysis of Voting in Committees,"
Cambridge University Press, number 9780521074650, August.
- Peleg, Bezalel, 2002. "Game-theoretic analysis of voting in committees," Handbook of Social Choice and Welfare,in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 1, chapter 8, pages 395-423 Elsevier.
- Bezalel Peleg, 1997. "Effectivity functions, game forms, games, and rights," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 15(1), pages 67-80.
- Satterthwaite, Mark Allen, 1975. "Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions," Journal of Economic Theory, Elsevier, vol. 10(2), pages 187-217, April. Full references (including those not matched with items on IDEAS)