User talk:Matijaskala/Probabilistic Approval Voting

Trying to understand this

1. P: A → B means the function P maps from set A to set B
2. C×C is the cartesian product of set C with itself, meaning that the domain of the function is all ordered pairs of candidates
3. C = the set of candidates (not the the set of complex numbers)
4. [0, 1] is the set of real numbers between 0 and 1, inclusive
5. W = the set of candidates, again?
6. Since C×C includes (A, A), then the "expected number of elected candidates belonging to the same faction as A" includes A? And so is always at least 1?
7. What is "expected average load"?
8. What is V? Number of voters who approve of a given candidate?
9. $\textstyle {\frac {V(A\land B)}{V(A\lor B)}}$ = (number of voters who approve of A and B) / (number who approve of A or B or both)?
10. Should link "Hare quota" to an article that defines it
11. What is "universal liking condition"?
12. This system is deterministic, correct? Even though it says "probabilistic" in the name?

— Psephomancy (talk) 05:51, 19 February 2020 (UTC)