Do you want BuboFlash to help you learning these things? Or do you want to add or correct something? Click here to log in or create user.



Tags
#chracterization #computation #social-choice #voting-rules
Question
Young's Theorem states that F is a [...] iff it satisfies anonymity , neutrality, reinforcement, and a technical condition known as continuity.
Answer
(generalised) positional scoring rule

Tags
#chracterization #computation #social-choice #voting-rules
Question
Young's Theorem states that F is a [...] iff it satisfies anonymity , neutrality, reinforcement, and a technical condition known as continuity.
Answer
?

Tags
#chracterization #computation #social-choice #voting-rules
Question
Young's Theorem states that F is a [...] iff it satisfies anonymity , neutrality, reinforcement, and a technical condition known as continuity.
Answer
(generalised) positional scoring rule
If you want to change selection, open original toplevel document below and click on "Move attachment"

Parent (intermediate) annotation

Open it
Young showed that F is a (generalised) positional scoring rule iff it satisfies anonymity , neutrality, reinforcement, and a technical condition known as continuity.

Original toplevel document (pdf)

owner: rappatoni - (no access) - comsoc-characterisation-2017 (1).pdf, p8

Summary

statusnot learnedmeasured difficulty37% [default]last interval [days]               
repetition number in this series0memorised on               scheduled repetition               
scheduled repetition interval               last repetition or drill

Details

No repetitions


Discussion

Do you want to join discussion? Click here to log in or create user.