User:Matijaskala/Probabilistic Approval Voting: Difference between revisions
User:Matijaskala/Probabilistic Approval Voting (view source)
Revision as of 15:15, 15 January 2024
, 4 months agono edit summary
Matijaskala (talk | contribs) m (Matijaskala moved page User:Matija/Probabilistic Approval Voting to User:Matijaskala/Probabilistic Approval Voting over redirect) |
Matijaskala (talk | contribs) No edit summary |
||
Line 8:
* <math display="inline">V(A)</math> ... number of voters who approve of A
* <math display="inline">V(A \and B)</math> ... number of voters who approve of both A and B
Let's say that there is a function <math>P:C \times C \to [0, 1]</math> that maps two given candidates to the probability that
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(
In [[party list case]] P(A,B) equals 1 if A and B belong to the same party and 0 otherwise. Because of that the system decays into [[D'Hondt]].
Line 29 ⟶ 28:
</blockquote>
In each step we elect the candidate with the highest <math display="inline">\frac{V(A)}{1+\sum_{X \in W} \frac{V(A \and X)}{V(
<math display="inline">\frac{V(A \and B)}{V(
<math display="inline">\frac{V(A \and C)}{V(
<math display="inline">\frac{V(B \and C)}{V(B
First seat:
Line 49 ⟶ 48:
Second seat:
A: <math display="inline">V(A)/(1 + \frac{V(A \and B)}{V(
C: <math display="inline">V(C)/(1 + \frac{V(C \and B)}{V(
A is elected
|