Overview

strategy-proofness


Show Summary Details

Quick Reference

A voting procedure is said to be strategy‐proof if it never rewards any voter for pretending that his or her preferences are other than his or her true ones. In the 1970s Allan Gibbard and Mark Satterthwaite independently proved that it was a corollary of Arrow's impossibility theorem that no fair and non‐random procedure was strategy‐proof.

Subjects: Politics.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.