User:Matijaskala/Probabilistic Approval Voting: Difference between revisions
User:Matijaskala/Probabilistic Approval Voting (view source)
Revision as of 15:07, 4 March 2020
, 4 years agono edit summary
Matijaskala (talk | contribs) (/expected average load/voter efficiency) |
Matijaskala (talk | contribs) No edit summary |
||
Line 6:
In practice, electing a candidate whose inverse score is at least as low as inverse Hare quota will not always be possible. In that case we need to either add fail-safe approvals which we previously didn't consider or elect the candidate with the lowest inverse score and hope it is low enough.
A reasonable choice for P(A,B) would be <math display="inline">\frac{V(A \and B)}{V(A \or B)}</math> which would give <math>\frac{V(A)}{1+\sum_{X \in W} \frac{V(A \and X)}{V(A \or X)}}</math> as the formula for the score of candidate A. In each step we elect the candidate with the highest score. This version of the system is 2-level [[Summability criterion|precinct-summable]] and passes
== Score ballots ==
| |||