Editing Gibbard–Satterthwaite theorem (section)

== Importance ==
The Gibbard–Satterthwaite theorem is generally presented as a result about voting systems, but it can also be seen as an important result of [[mechanism design]], which deals with a broader class of decision rules. [[Noam Nisan]] describes this relation:<ref name="agt" />{{rp|215}}<blockquote>The GS theorem seems to quash any hope of designing incentive-compatible social-choice functions. The whole field of Mechanism Design attempts escaping from this impossibility result using various modifications in the model.</blockquote>The main idea of these "escape routes" is that they allow for a broader class of mechanisms than ranked voting, similarly to the escape routes from [[Arrow's impossibility theorem]].