Tags
#computation #social-choice #voting-rules
Question
a resolute SCF F is called surjective (or nonimposed ) if
Answer
for every alternative x ∈ X there exists a profile R such that F (R) = x.
Tags
#computation #social-choice #voting-rules
Question
a resolute SCF F is called surjective (or nonimposed ) if
Tags
#computation #social-choice #voting-rules
Question
a resolute SCF F is called surjective (or nonimposed ) if
Answer
for every alternative x ∈ X there exists a profile R such that F (R) = x.
If you want to change selection, open document below and click on "Move attachment"
pdf
owner:
rappatoni - (no access) - comsoc-impossibilities-2017 (1).pdf, p16
Summary
| status | not learned | | measured difficulty | 37% [default] | | last interval [days] | |
|---|
| repetition number in this series | 0 | | memorised on | | | scheduled repetition | |
|---|
| scheduled repetition interval | | | last repetition or drill | | | | |
|---|
Details
No repetitions