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.
|Date of creation:||Apr 2007|
|Date of revision:|
|Contact details of provider:|| Postal: Feldman Building - Givat Ram - 91904 Jerusalem|
Web page: http://www.ratio.huji.ac.il/
More information through EDIRC
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, 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
- Bezalel Peleg, 1997. "Effectivity functions, game forms, games, and rights," Social Choice and Welfare, Springer, 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.
When requesting a correction, please mention this item's handle: RePEc:huj:dispap:dp451. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ilan Nehama)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.