we can always split a decisive coalition C into two nonempty subsets C 1 ,C 2 with C 1 ∪ C 2 = C and C 1 ∩ C 2 =∅ such that one of C 1 and C 2 is decisive for all pairs as well.
Tags
#computation #social-choice
Question
Splitting Lemma
Answer
?
Tags
#computation #social-choice
Question
Splitting Lemma
Answer
we can always split a decisive coalition C into two nonempty subsets C 1 ,C 2 with C 1 ∪ C 2 = C and C 1 ∩ C 2 =∅ such that one of C 1 and C 2 is decisive for all pairs as well.
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 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
Discussion
Do you want to join discussion? Click here to log in or create user.