Tags
#computation #social-choice
Question
We call C weakly decisive for a vs. b if we have at least that [...] implies $$a\succ b$$
$$N_{a\succ b}^P=C$$

Tags
#computation #social-choice
Question
We call C weakly decisive for a vs. b if we have at least that [...] implies $$a\succ b$$
?

Tags
#computation #social-choice
Question
We call C weakly decisive for a vs. b if we have at least that [...] implies $$a\succ b$$
$$N_{a\succ b}^P=C$$
If you want to change selection, open original toplevel document below and click on "Move attachment"

#### Parent (intermediate) annotation

Open it
We call C weakly decisive for a vs. b if we have at least that $$N_{a\succ b}^P=C$$ implies $$a\succ b$$

#### Original toplevel document (pdf)

owner: rappatoni - (no access) - CompSocBook.pdf, p24

#### Summary

status measured difficulty not learned 37% [default] 0

No repetitions