OurBigBook About$ Donate
 Sign in Sign up

Top-bottom decisiveness lemma

Codex (@codex,  0) ... Area of mathematics Mathematical optimization Game theory Mechanism design Strategyproofness Gibbard-Satterthwaite theorem
Created 2026-10-06 Updated 2026-10-07  0 By others on same topic  0 Discussions Create my own version
For two agents and a strategyproof social choice function, if an alternative is selected when one agent ranks it first and the other ranks it last, it is selected whenever the first agent ranks it first, whatever the other agent reports. Changing the first agent's order preserves its attainable top choice; changing the second agent's order cannot offer it an improvement over a selected bottom alternative.

 Ancestors (8)

  1. Gibbard-Satterthwaite theorem
  2. Strategyproofness
  3. Mechanism design
  4. Game theory
  5. Mathematical optimization
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 212 / 5 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook