#computation #social-choice
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\)
If you want to change selection, open document below and click on "Move attachment"
pdf
owner:
rappatoni - (no access) - CompSocBook.pdf, p24
Summary
status | not read | | reprioritisations | |
---|
last reprioritisation on | | | suggested re-reading day | |
---|
started reading on | | | finished reading on | |
---|
Details