enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Gibbard–Satterthwaite theorem - Wikipedia

    en.wikipedia.org/wiki/GibbardSatterthwaite...

    The Gibbard–Satterthwaite theorem is a theorem in social choice theory. It was first conjectured by the philosopher Michael Dummett and the mathematician Robin Farquharson in 1961 [ 1 ] and then proved independently by the philosopher Allan Gibbard in 1973 [ 2 ] and economist Mark Satterthwaite in 1975. [ 3 ]

  3. Gibbard's theorem - Wikipedia

    en.wikipedia.org/wiki/Gibbard's_theorem

    A corollary of this theorem is the Gibbard–Satterthwaite theorem about voting rules. The key difference between the two theorems is that Gibbard–Satterthwaite applies only to ranked voting. Because of its broader scope, Gibbard's theorem makes no claim about whether voters need to reverse their ranking of candidates, only that their optimal ...

  4. Proof of impossibility - Wikipedia

    en.wikipedia.org/wiki/Proof_of_impossibility

    Gibbard's theorem shows that any strategyproof game form (i.e. one with a dominant strategy) with more than two outcomes is dictatorial. The Gibbard–Satterthwaite theorem is a special case showing that no deterministic voting system can be fully invulnerable to strategic voting in all circumstances, regardless of how others vote.

  5. Allan Gibbard - Wikipedia

    en.wikipedia.org/wiki/Allan_Gibbard

    This work would eventually become known as "Gibbard's theorem", published in 1973. [2] Mark Satterthwaite later worked on a similar theorem which he published in 1975. [8] [9] Satterthwaite and Jean Marie Brin published a paper in 1978 describing Gibbard's and Satterthwaite's mathematical proofs as the "Gibbard–Satterthwaite theorem" and ...

  6. Revelation principle - Wikipedia

    en.wikipedia.org/wiki/Revelation_principle

    The revelation principle is a fundamental result in mechanism design, social choice theory, and game theory which shows it is always possible to design a strategy-resistant implementation of a social decision-making mechanism (such as an electoral system or market). [1] It can be seen as a kind of mirror image to Gibbard's theorem.

  7. Mechanism design - Wikipedia

    en.wikipedia.org/wiki/Mechanism_design

    Because it starts with the end of the game (a particular result), then works backwards to find a game that implements it, it is sometimes described as reverse game theory. [2] Leonid Hurwicz explains that "in a design problem, the goal function is the main given, while the mechanism is the unknown. Therefore, the design problem is the inverse ...

  8. Tangent half-angle substitution - Wikipedia

    en.wikipedia.org/wiki/Tangent_half-angle...

    The tangent of half an angle is important in spherical trigonometry and was sometimes known in the 17th century as the half tangent or semi-tangent. [2] Leonhard Euler used it to evaluate the integral ∫ d x / ( a + b cos ⁡ x ) {\textstyle \int dx/(a+b\cos x)} in his 1768 integral calculus textbook , [ 3 ] and Adrien-Marie Legendre described ...

  9. Duggan–Schwartz theorem - Wikipedia

    en.wikipedia.org/wiki/Duggan–Schwartz_theorem

    The Duggan–Schwartz theorem (named after John Duggan and Thomas Schwartz) is a result about voting systems designed to choose a nonempty set of winners from the preferences of certain individuals, where each individual ranks all candidates in order of preference. It states that for three or more candidates, at least one of the following must ...