Tags
#computation #social-choice #voting-rules
Question
F is called liberal if, for every individual i ∈ N , there exist two distinct alternatives x, y ∈ X such that i is two-way decisive on x and y :
Answer
\(i\in N^R_{x\succ y}\) implies \(y\notin F(R)\) and \(i\in N^R_{y\succ x}\) implies \(x\notin F(R)\)
Tags
#computation #social-choice #voting-rules
Question
F is called liberal if, for every individual i ∈ N , there exist two distinct alternatives x, y ∈ X such that i is two-way decisive on x and y :
Tags
#computation #social-choice #voting-rules
Question
F is called liberal if, for every individual i ∈ N , there exist two distinct alternatives x, y ∈ X such that i is two-way decisive on x and y :
Answer
\(i\in N^R_{x\succ y}\) implies \(y\notin F(R)\) and \(i\in N^R_{y\succ x}\) implies \(x\notin F(R)\)
If you want to change selection, open document below and click on "Move attachment"
pdf
owner:
rappatoni - (no access) - comsoc-impossibilities-2017 (1).pdf, p5
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